• Corpus ID: 25190754

A Model of Selective Advantage for the Efficient Inference of Cancer Clonal Evolution

  title={A Model of Selective Advantage for the Efficient Inference of Cancer Clonal Evolution},
  author={Daniele Ramazzotti},
Recently, there has been a resurgence of interest in rigorous algorithms for the inference of cancer progression from genomic data. The motivations are manifold: (i) growing NGS and single cell data from cancer patients, (ii) need for novel Data Science and Machine Learning algorithms to infer models of cancer progression, and (iii) a desire to understand the temporal and heterogeneous structure of tumor to tame its progression by efficacious therapeutic intervention. This thesis presents a… 
Learning mutational graphs of individual tumor evolution from multi-sample sequencing data
TRaIT can quantify the extent of intra-tumor heterogeneity and generate new testable experimental hypotheses, and displays better accuracy, performance and robustness to noise and small sample size than state-of-the-art phylogenetic methods.
Learning mutational graphs of individual tumour evolution from single-cell and multi-region sequencing data
This work introduces TRaIT, a computational framework to infer mutational graphs that model the accumulation of multiple types of somatic alterations driving tumour evolution that improves accuracy, robustness to data-specific errors and computational complexity compared to competing methods.
Modeling Cumulative Biological Phenomena with Suppes-Bayes Causal Networks
The theoretical foundations of this approach are discussed and the influence on the model selection task of (1) the poset based on Suppes’ theory and (2) different regularization strategies are investigated.
Learning the Probabilistic Structure of Cumulative Phenomena with Suppes-Bayes Causal Networks
This work investigates the structure learning of SBCNs via extensive simulations with various state-of-the-art search strategies, such as canonical local search techniques and Genetic Algorithms, and shows that Suppes’ constraints deeply simplify the learning task, by reducing the solution search space and providing a temporal ordering on the variables.
Structural Learning of Probabilistic Graphical Models of Cumulative Phenomena
This investigation is intended to be an extension and an in-depth clarification of the previous works on SBCN structure learning, and shows that Suppes’ constraints do simplify the learning task, by reducing the solution search space and providing a temporal ordering on the variables, which simplifies the complications derived by I-equivalent structures.
Exposing the probabilistic causal structure of discrimination
This paper defines a method to extract, from a dataset of historical decision records, the causal structures existing among the attributes in the data, and develops a type of constrained Bayesian network, which it dubs Suppes-Bayes causal network (SBCN).


Algorithmic methods to infer the evolutionary trajectories in cancer progression
PiCnIc is introduced to infer the underlying somatic evolution of ensembles of tumors from next-generation sequencing data and its ability to reproduce much of the current knowledge on colorectal cancer progression as well as to suggest novel experimentally verifiable hypotheses is demonstrated.
CAPRI: efficient inference of cancer progression models from cross-sectional data
A novel inference algorithm to effectively solve the cancer progression model reconstruction problem, CAncer PRogression Inference (CAPRI), which is efficient, efficient, achieves high accuracy, and has good complexity, also, in terms of convergence properties.
A mathematical framework to determine the temporal sequence of somatic genetic events in cancer
Retracing the Evolutionary Steps in Cancer (RESIC) is described, which represents the first evolutionary mathematical approach to identify the temporal sequence of mutations driving tumorigenesis and may be useful to guide the validation of candidate genes emerging from cancer genome surveys.
Inferring the paths of somatic evolution in cancer
Bayesian Mutation Landscape (BML), a probabilistic approach for reconstructing ancestral genotypes from tumor samples for much larger sets of genes than previously feasible, is developed.
Design of the TRONCO BioConductor Package for TRanslational ONCOlogy
TRONCO is an R package for TRanslational ONcology which provides a serie of functions to assist the user in the analysis of cross-sectional genomic data and, in particular, it implements algorithms that aim to model cancer progression by means of the notion of selective advantage, proved to outperform the current state-of-the-art in the inference of cancer progression models.
Distance-Based Reconstruction of Tree Models for Oncogenesis
Thedistance-based tree method is illustrated and how it complements the branching tree method, with a CGH data set for renal cancer, and how to reconstruct the distance-based trees using tree-fitting algorithms developed by researchers in phylogenetics.
Cancer Evolution: Mathematical Models and Computational Inference
Recent approaches to modeling the evolution of cancer, including population dynamics models of tumor initiation and progression, phylogenetic methods to model the evolutionary relationship between tumor subclones, and probabilistic graphical models to describe dependencies among mutations are reviewed.
Quantifying cancer progression with conjunctive Bayesian networks
This work presents a specific probabilistic graphical model for the accumulation of mutations and their interdependencies in cancer progression that can be used to improve genetics-based survival predictions which could support diagnostics and prognosis.
SciClone: Inferring Clonal Architecture and Tracking the Spatial and Temporal Patterns of Tumor Evolution
SciClone is a computational method that is used to detect subclones in acute myeloid leukemia and breast cancer samples that, though present at disease onset, are not evident from a single primary tumor sample, and can track tumor evolution and identify the spatial origins of cells resisting therapy.
Efficient methods for identifying mutated driver pathways in cancer
This study proposes two methods to solve the so-called maximum weight submatrix problem, which is designed to de novo identify mutated driver pathways from mutation data in cancer, and proposes an integrative model to combine mutation and expression data.