TUMOR HAPLOTYPE ASSEMBLY ALGORITHMS FOR CANCER GENOMICS

2013 ◽  
Author(s):  
DEREK AGUIAR ◽  
WENDY S. W. WONG ◽  
SORIN ISTRAIL
Keyword(s):  
Cancer Genomics ◽  
Haplotype Assembly ◽  
Assembly Algorithms

scholarly journals Hap10: reconstructing accurate and long polyploid haplotypes using linked reads

2020 ◽  
Author(s):  
Sina Majidian ◽  
Mohammad Hossein Kahaei ◽  
Dick de Ridder
Keyword(s):  
Relevant Information ◽  
Connected Components ◽  
Strongly Connected Components ◽  
Haplotype Assembly ◽  
Sequencing Technologies ◽  
Genomic Analyses ◽  
Strongly Connected ◽  
Polyploid Genome ◽  
Assembly Algorithms ◽  
Haplotype Information

AbstractBackgroundHaplotype information is essential for many genetic and genomic analyses, including genotype-phenotype associations in human, animals and plants. Haplotype assembly is a method for reconstructing haplotypes from DNA sequencing reads. By the advent of new sequencing technologies, new algorithms are needed to ensure long and accurate haplotypes. While a few linked-read haplotype assembly algorithms are available for diploid genomes, there are no algorithms yet for polyploids.ResultsThe first haplotyping algorithm designed for 10X linked reads generated from a polyploid genome is presented, built on a typical short-read haplotyping method, SDhaP. Using the input aligned reads and called variants, the haplotype-relevant information is extracted. Next, reads with the same barcodes are combined to produce molecule-specific fragments. Then, these fragments are clustered into strongly connected components which are then used as input of a haplotype assembly core in order to estimate accurate and long haplotypes.ConclusionsHap10 is a novel algorithm for haplotype assembly of polyploid genomes using linked reads. The performance of the algorithms is evaluated in a number of simulation scenarios and its applicability is demonstrated on a real dataset of sweet potato.

A Study of DNA Fragment Assembly Algorithms

10.26524/jap2 ◽  
2016 ◽  
Vol 1 (1) ◽  
pp. 10-16
Author(s):  
Satyanarayana Reddy Beeram ◽  
Edara Srinivasa Reddy
Keyword(s):  
Fragment Assembly ◽  
Dna Fragment ◽  
Assembly Algorithms ◽  
Dna Fragment Assembly

scholarly journals Bayesian graphical models for modern biological applications

2021 ◽  
Author(s):  
Yang Ni ◽  
Veerabhadran Baladandayuthapani ◽  
Marina Vannucci ◽  
Francesco C. Stingo
Keyword(s):  
Graphical Models ◽  
Cancer Genomics ◽  
Graph Structure ◽  
Biological Processes ◽  
Limited Sample ◽  
Large Networks ◽  
Bayesian Approaches ◽  
Complex Sampling ◽  
Complex Dependence ◽  
Bayesian Graphical Models

AbstractGraphical models are powerful tools that are regularly used to investigate complex dependence structures in high-throughput biomedical datasets. They allow for holistic, systems-level view of the various biological processes, for intuitive and rigorous understanding and interpretations. In the context of large networks, Bayesian approaches are particularly suitable because it encourages sparsity of the graphs, incorporate prior information, and most importantly account for uncertainty in the graph structure. These features are particularly important in applications with limited sample size, including genomics and imaging studies. In this paper, we review several recently developed techniques for the analysis of large networks under non-standard settings, including but not limited to, multiple graphs for data observed from multiple related subgroups, graphical regression approaches used for the analysis of networks that change with covariates, and other complex sampling and structural settings. We also illustrate the practical utility of some of these methods using examples in cancer genomics and neuroimaging.

scholarly journals Ranking cancer drivers via betweenness-based outlier detection and random walks

2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Cesim Erten ◽  
Aissa Houdjedj ◽  
Hilal Kazan
Keyword(s):  
Cancer Genomics ◽  
Interaction Network ◽  
Molecular Data ◽  
Alternative Methods ◽  
Patient Specific ◽  
Cancer Genes ◽  
Driver Genes ◽  
Cancer Driver ◽  
Protein Protein Interaction ◽  
Genomic Studies

Abstract Background Recent cancer genomic studies have generated detailed molecular data on a large number of cancer patients. A key remaining problem in cancer genomics is the identification of driver genes. Results We propose BetweenNet, a computational approach that integrates genomic data with a protein-protein interaction network to identify cancer driver genes. BetweenNet utilizes a measure based on betweenness centrality on patient specific networks to identify the so-called outlier genes that correspond to dysregulated genes for each patient. Setting up the relationship between the mutated genes and the outliers through a bipartite graph, it employs a random-walk process on the graph, which provides the final prioritization of the mutated genes. We compare BetweenNet against state-of-the art cancer gene prioritization methods on lung, breast, and pan-cancer datasets. Conclusions Our evaluations show that BetweenNet is better at recovering known cancer genes based on multiple reference databases. Additionally, we show that the GO terms and the reference pathways enriched in BetweenNet ranked genes and those that are enriched in known cancer genes overlap significantly when compared to the overlaps achieved by the rankings of the alternative methods.

scholarly journals The Role of Network Science in Glioblastoma

Cancers ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 1045
Author(s):  
Marta B. Lopes ◽  
Eduarda P. Martins ◽  
Susana Vinga ◽  
Bruno M. Costa
Keyword(s):  
Personalized Medicine ◽  
Drug Development ◽  
Information Flow ◽  
Clinical Studies ◽  
Network Science ◽  
Cancer Genomics ◽  
High Dimensional ◽  
Network Discovery ◽  
Software Implementations

Network science has long been recognized as a well-established discipline across many biological domains. In the particular case of cancer genomics, network discovery is challenged by the multitude of available high-dimensional heterogeneous views of data. Glioblastoma (GBM) is an example of such a complex and heterogeneous disease that can be tackled by network science. Identifying the architecture of molecular GBM networks is essential to understanding the information flow and better informing drug development and pre-clinical studies. Here, we review network-based strategies that have been used in the study of GBM, along with the available software implementations for reproducibility and further testing on newly coming datasets. Promising results have been obtained from both bulk and single-cell GBM data, placing network discovery at the forefront of developing a molecularly-informed-based personalized medicine.

Sign in / Sign up

Export Citation Format

Share Document