Gene/Protein Disease Symptom Drug Enzyme Compound
Pivot Concepts:   Target Concepts:
Query: UMLS:C0178874 (tumor progression)
 40,807 document(s) hit in 31,850,051 MEDLINE articles (0.00 seconds)

Static expression experiments analyze samples from many individuals. These samples are often snapshots of the progression of a certain disease such as cancer. This raises an intriguing question: Can we determine a temporal order for these samples? Such an ordering can lead to better understanding of the dynamics of the disease and to the identification of genes associated with its progression. In this paper we formally prove, for the first time, that under a model for the dynamics of the expression levels of a single gene, it is indeed possible to recover the correct ordering of the static expression datasets by solving an instance of the traveling salesman problem (TSP). In addition, we devise an algorithm that combines a TSP heuristic and probabilistic modeling for inferring the underlying temporal order of the microarray experiments. This algorithm constructs probabilistic continuous curves to represent expression profiles leading to accurate temporal reconstruction for human data. Applying our method to cancer expression data we show that the ordering derived agrees well with survival duration. A classifier that utilizes this ordering improves upon other classifiers suggested for this task. The set of genes displaying consistent behavior for the determined ordering are enriched for genes associated with cancer progression.
IEEE/ACM Trans Comput Biol Bioinform
PMID:Extracting dynamics from static cancer expression data. 1845 27

Cancer cells exhibit a common phenotype of uncontrolled cell growth, but this phenotype may arise from many different combinations of mutations. By inferring how cells evolve in individual tumors, a process called cancer progression, we may be able to identify important mutational events for different tumor types, potentially leading to new therapeutics and diagnostics. Prior work has shown that it is possible to infer frequent progression pathways by using gene expression profiles to estimate "distances" between tumors. Here, we apply gene network models to improve these estimates of evolutionary distance by controlling for correlations among coregulated genes. We test three variants of this approach: one using an optimized best-fit network, another using sampling to infer a high-confidence subnetwork, and one using a modular network inferred from clusters of similarly expressed genes. Application to lung cancer and breast cancer microarray data sets shows small improvements in phylogenies when correcting from the optimized network and more substantial improvements when correcting from the sampled or modular networks. Our results suggest that a network correction approach improves estimates of tumor similarity, but sophisticated network models are needed to control for the large hypothesis space and sparse data currently available.
IEEE/ACM Trans Comput Biol Bioinform
PMID:Network-based inference of cancer progression from microarray data. 1940 45

We recently reported that membrane-type 1 matrix metalloproteinase (MT1-MMP) is phosphorylated on its unique cytoplasmic tyrosine residue but the contribution of this event to tumor progression remains unclear. In this work, we show that the non phosphorylizable cell-permeable peptide antennapedia-coupled cytoplasmic MMP-14 (ACM-14), consisting of the mutated (Y573F) cytoplasmic domain of MT1-MMP coupled to antennapedia, inhibits tyrosine phosphorylation of the enzyme and markedly reduces tumor cell proliferation within 3D type I collagen matrices. Interestingly, administration of ACM-14 to mice markedly delays tumor progression and increases survival, these antitumor actions being associated with the induction of extensive tumor necrosis. Overall, these findings suggest that inhibition of MT1-MMP tyrosine phosphorylation may represent an attractive strategy for the development of novel anticancer drugs.
 ...
PMID:Inhibition of membrane-type 1 matrix metalloproteinase tyrosine phosphorylation blocks tumor progression in mice. 2065 31

Computational cancer phylogenetics seeks to enumerate the temporal sequences of aberrations in tumor evolution, thereby delineating the evolution of possible tumor progression pathways, molecular subtypes, and mechanisms of action. We previously developed a pipeline for constructing phylogenies describing evolution between major recurring cell types computationally inferred from whole-genome tumor profiles. The accuracy and detail of the phylogenies, however, depend on the identification of accurate, high-resolution molecular markers of progression, i.e., reproducible regions of aberration that robustly differentiate different subtypes and stages of progression. Here, we present a novel hidden Markov model (HMM) scheme for the problem of inferring such phylogenetically significant markers through joint segmentation and calling of multisample tumor data. Our method classifies sets of genome-wide DNA copy number measurements into a partitioning of samples into normal (diploid) or amplified at each probe. It differs from other similar HMM methods in its design specifically for the needs of tumor phylogenetics, by seeking to identify robust markers of progression conserved across a set of copy number profiles. We show an analysis of our method in comparison to other methods on both synthetic and real tumor data, which confirms its effectiveness for tumor phylogeny inference and suggests avenues for future advances.
IEEE/ACM Trans Comput Biol Bioinform
PMID:Novel multisample scheme for inferring phylogenetic markers from whole genome tumor profiles. 2440 1

Cancer forms a robust system capable of maintaining stable functioning (cell sustenance and proliferation) despite perturbations. Cancer progresses as stages over time typically with increasing aggressiveness and worsening prognosis. Characterizing these stages and identifying the genes driving transitions between them is critical to understand cancer progression and to develop effective anti-cancer therapies. In this work, we propose a novel model for the `cancer system' as a Boolean state space in which a Boolean network, built from protein-interaction and gene-expression data from different stages of cancer, transits between Boolean satisfiability states by "editing" interactions and "flipping" genes. Edits reflect rewiring of the PPI network while flipping of genes reflect activation or silencing of genes between stages. We formulate a minimization problem min flip to identify these genes driving the transitions. The application of our model (called BoolSpace) on three case studies-pancreatic and breast tumours in human and post spinal-cord injury (SCI) in rats-reveals valuable insights into the phenomenon of cancer progression: (i) interactions involved in core cell-cycle and DNA-damage repair pathways are significantly rewired in tumours, indicating significant impact to key genome-stabilizing mechanisms; (ii) several of the genes flipped are serine/threonine kinases which act as biological switches, reflecting cellular switching mechanisms between stages; and (iii) different sets of genes are flipped during the initial and final stages indicating a pattern to tumour progression. Based on these results, we hypothesize that robustness of cancer partly stems from "passing of the baton" between genes at different stages-genes from different biological processes and/or cellular components are involved in different stages of tumour progression thereby allowing tumour cells to evade targeted therapy, and therefore an effective therapy should target a "cover set" of these genes. A C/C++ implementation of BoolSpace is freely available at: http://www.bioinformatics.org.au/tools-data.
IEEE/ACM Trans Comput Biol Bioinform
PMID:Evolution and Controllability of Cancer Networks: A Boolean Perspective. 2635 10

Large-scale cancer genomics projects are providing a wealth of somatic mutation data from a large number of cancer patients. However, it is difficult to obtain several samples with a temporal order from one patient in evaluating the cancer progression. Therefore, one of the most challenging problems arising from the data is to infer the temporal order of mutations across many patients. To solve the problem efficiently, we present a Network-based method (NetInf) to Infer cancer progression at the pathway level from cross-sectional data across many patients, leveraging on the exclusive property of driver mutations within a pathway and the property of linear progression between pathways. To assess the robustness of NetInf, we apply it on simulated data with the addition of different levels of noise. To verify the performance of NetInf, we apply it to analyze somatic mutation data from three real cancer studies with large number of samples. Experimental results reveal that the pathways detected by NetInf show significant enrichment. Our method reduces computational complexity by constructing gene networks without assigning the number of pathways, which also provides new insights on the temporal order of somatic mutations at the pathway level rather than at the gene level.
IEEE/ACM Trans Comput Biol Bioinform
PMID:Network-Based Method for Inferring Cancer Progression at the Pathway Level from Cross-Sectional Mutation Data. 2691 28

Determining the dynamics of pathways associated with cancer progression is critical for understanding the etiology of diseases. Advances in biological technology have facilitated the simultaneous genomic profiling of multiple patients at different clinical stages, thus generating the dynamic genomic data for cancers. Such data provide enable investigation of the dynamics of related pathways. However, methods for integrative analysis of dynamic genomic data are inadequate. In this study, we develop a novel nonnegative matrix factorization algorithm for dynamic modules ( NMF-DM), which simultaneously analyzes multiple networks for the identification of stage-specific and dynamic modules. NMF-DM applies the temporal smoothness framework by balancing the networks at the current stage and the previous stage. Experimental results indicate that the NMF-DM algorithm is more accurate than the state-of-the-art methods in artificial dynamic networks. In breast cancer networks, NMF-DM reveals the dynamic modules that are important for cancer stage transitions. Furthermore, the stage-specific and dynamic modules have distinct topological and biochemical properties. Finally, we demonstrate that the stage-specific modules significantly improve the accuracy of cancer stage prediction. The proposed algorithm provides an effective way to explore the time-dependent cancer genomic data.
IEEE/ACM Trans Comput Biol Bioinform
PMID:Extracting Stage-Specific and Dynamic Modules Through Analyzing Multiple Networks Associated with Cancer Progression. 2784 71

Different types of genomic aberration may simultaneously contribute to tumorigenesis. To obtain a more accurate prognostic assessment to guide therapeutic regimen choice for cancer patients, the heterogeneous multi-omics data should be integrated harmoniously, which can often be difficult. For this purpose, we propose a Gene Interaction Regularized Elastic Net (GIREN) model that predicts clinical outcome by integrating multiple data types. GIREN conveniently embraces both gene measurements and gene-gene interaction information under an elastic net formulation, enforcing structure sparsity, and the "grouping effect" in solution to select the discriminate features with prognostic value. An iterative gradient descent algorithm is also developed to solve the model with regularized optimization. GIREN was applied to human ovarian cancer and breast cancer datasets obtained from The Cancer Genome Atlas, respectively. Result shows that, the proposed GIREN algorithm obtained more accurate and robust performance over competing algorithms (LASSO, Elastic Net, and Semi-supervised PCA, with or without average pathway expression features) in predicting cancer progression on both two datasets in terms of median area under curve (AUC) and interquartile range (IQR), suggesting a promising direction for more effective integration of gene measurement and gene interaction information.
IEEE/ACM Trans Comput Biol Bioinform
PMID:Cancer Progression Prediction Using Gene Interaction Regularized Elastic Net. 2805 97

Identification of intracellular pathways that play key roles in cancer progression and drug resistance is a prerequisite for developing targeted cancer treatments. The era of personalized medicine calls for computational methods that can function with one sample or a very small set of samples. Developing such methods is challenging because standard statistical approaches pose several limiting assumptions, such as number of samples, that prevent their application when approaches to one. We have developed a novel pathway analysis method called PerPAS to estimate pathway activity at a single sample level by integrating pathway topology and transcriptomics data. In addition, PerPAS is able to identify altered pathways between cancer and control samples as well as to identify key nodes that contribute to the pathway activity. In our case study using breast cancer data, we show that PerPAS can identify highly altered pathways that are associated with patient survival. PerPAS identified four pathways that were associated with patient survival and were successfully validated in three independent breast cancer cohorts. In comparison to two other pathway analysis methods that function at a single sample level, PerPAS had superior performance in both synthetic and breast cancer expression datasets. PerPAS is a free R package (http://csbi.ltdk.helsinki.fi/pub/czliu/perpas/).
IEEE/ACM Trans Comput Biol Bioinform
PMID:PerPAS: Topology-Based Single Sample Pathway Analysis Method. 2828 81

Next-generation sequencing (NGS) technologies provide amount of somatic mutation data in a large number of patients. The identification of mutated driver pathway and cancer progression from these data is a challenging task because of the heterogeneity of interpatient. In addition, cancer progression at the pathway level has been proved to be more reasonable than at the gene level. In this paper, we introduce an integrated framework to identify mutated driver pathways and cancer progression (iMDPCP) at the pathway level from somatic mutation data. First, we use uncertainty coefficient to quantify mutual exclusivity on gene driver pathways and develop a computational framework to identify mutated driver pathways based on the adaptive discrete differential evolution algorithm. Then, we construct cancer progression model for driver pathways based on the Bayesian Network. Finally, we evaluate the performance of iMDPCP on real cancer somatic mutation datasets. The experimental results indicate that iMDPCP is more accurate than state-of-the-art methods according to the enrichment of KEGG pathways, and it also provides new insights on identifying cancer progression at the pathway level.
IEEE/ACM Trans Comput Biol Bioinform
PMID:An Integrated Framework for Identifying Mutated Driver Pathway and Cancer Progression. 2999 Feb 86


1 2 Next >>