A complex disease, especially cancer, always has pre-deterioration stage during its progression, which is difficult to identify but crucial to drug research and clinical intervention. However, using a few samples to find mechanisms that propel cancer crossing the pre-deterioration stage is still a complex problem. In this study, we successfully developed a novel single-sample model based on node entropy with established protein interaction network. Using this model, critical stages were successfully detected in simulation data and four TCGA datasets, indicating its sensitivity and robustness. Besides, compared with the results of the differential analysis, our results showed that most of dynamic network biomarkers identified by node entropy, such as or , located in upstream in many important cancer-related signaling pathways regulated intergenic signaling within pathways. We also identified some novel prognostic biomarkers such as , , and using node entropy rather than expression level. More importantly, we found the switch of non-specific pathways related to DNA damage repairing was the main driven force for cancer progression. In conclusion, we have successfully developed a dynamic node entropy model based on single case data to find out tipping point and possible mechanism for cancer progression. These findings may provide new target genes in therapeutic intervention tactics.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7381145 | PMC |
http://dx.doi.org/10.3389/fbioe.2020.00809 | DOI Listing |
Entropy (Basel)
January 2025
Department of ECE, University of Arizona, Tucson, AZ 85721, USA.
In this paper, we introduce a novel gradient descent bit-flipping algorithm with a finite state machine (GDBF-wSM) for iterative decoding of low-density parity-check (LDPC) codes. The algorithm utilizes a finite state machine to update variable node potentials-for each variable node, the corresponding finite state machine adjusts the update value based on whether the node was a candidate for flipping in previous iterations. We also present a learnable framework that can optimize decoder parameters using a database of uncorrectable error patterns.
View Article and Find Full Text PDFEntropy (Basel)
January 2025
National Key Laboratory of Fundamental Science on Synthetic Vision, Sichuan University, Chengdu 610065, China.
Graph anomaly detection is crucial in many high-impact applications across diverse fields. In anomaly detection tasks, collecting plenty of annotated data tends to be costly and laborious. As a result, few-shot learning has been explored to address the issue by requiring only a few labeled samples to achieve good performance.
View Article and Find Full Text PDFEcol Evol
January 2025
Department of Ecology, Evolution, and Marine Biology University of California Santa Barbara Santa Barbara California USA.
Trade-offs between food acquisition and predator avoidance shape the landscape-scale movements of herbivores. These movements create landscape features, such as game trails, which are paths that animals use repeatedly to traverse the landscape. As such, these trails integrate behavioral trade-offs over space and time.
View Article and Find Full Text PDFEntropy (Basel)
December 2024
College of Electronic Science and Technology, National University of Defense Technology, Changsha 410073, China.
This paper focuses on the Low-Density Algebra-Check (LDAC) code, a novel low-rate channel code derived from the Low-Density Parity-Check (LDPC) code with expanded algebra-check constraints. A method for optimizing LDAC code design using Extrinsic Information Transfer (EXIT) charts is presented. Firstly, an iterative decoding model for LDAC is established according to its structure, and a method for plotting EXIT curves of the algebra-check node decoder is proposed.
View Article and Find Full Text PDFEntropy (Basel)
December 2024
Electronic Engineering Institute, National University of Defense Technology, Hefei 230037, China.
Correctly identifying influential nodes in a complex network and implementing targeted protection measures can significantly enhance the overall security of the network. Currently, indicators such as degree centrality, closeness centrality, betweenness centrality, H-index, and K-shell are commonly used to measure node influence. Although these indicators can identify critical nodes to some extent, they often consider node attributes from a narrow perspective and have certain limitations.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!