Iterative learning of single individual haplotypes from high-throughput DNA sequencing data

Author(s):  
Zrinka Puljiz ◽  
Haris Vikalo
2011 ◽  
Vol 21 (5) ◽  
pp. 734-740 ◽  
Author(s):  
M. Hsi-Yang Fritz ◽  
R. Leinonen ◽  
G. Cochrane ◽  
E. Birney

2017 ◽  
Author(s):  
Yuchao Jiang ◽  
Rujin Wang ◽  
Eugene Urrutia ◽  
Ioannis N. Anastopoulos ◽  
Katherine L. Nathanson ◽  
...  

AbstractHigh-throughput DNA sequencing enables detection of copy number variations (CNVs) on the genome-wide scale with finer resolution compared to array-based methods, but suffers from biases and artifacts that lead to false discoveries and low sensitivity. We describe CODEX2, a statistical framework for full-spectrum CNV profiling that is sensitive for variants with both common and rare population frequencies and that is applicable to study designs with and without negative control samples. We demonstrate and evaluate CODEX2 on whole-exome and targeted sequencing data, where biases are the most prominent. CODEX2 outperforms existing methods and, in particular, significantly improves sensitivity for common CNVs.


2020 ◽  
Vol 34 (01) ◽  
pp. 719-726
Author(s):  
Ziqi Ke ◽  
Haris Vikalo

Reconstructing components of a genomic mixture from data obtained by means of DNA sequencing is a challenging problem encountered in a variety of applications including single individual haplotyping and studies of viral communities. High-throughput DNA sequencing platforms oversample mixture components to provide massive amounts of reads whose relative positions can be determined by mapping the reads to a known reference genome; assembly of the components, however, requires discovery of the reads' origin – an NP-hard problem that the existing methods struggle to solve with the required level of accuracy. In this paper, we present a learning framework based on a graph auto-encoder designed to exploit structural properties of sequencing data. The algorithm is a neural network which essentially trains to ignore sequencing errors and infers the posterior probabilities of the origin of sequencing reads. Mixture components are then reconstructed by finding consensus of the reads determined to originate from the same genomic component. Results on realistic synthetic as well as experimental data demonstrate that the proposed framework reliably assembles haplotypes and reconstructs viral communities, often significantly outperforming state-of-the-art techniques. Source codes, datasets and supplementary document are available at https://github.com/WuLoli/GAEseq.


2019 ◽  
Author(s):  
Ziqi Ke ◽  
Haris Vikalo

AbstractReconstructing components of a genomic mixture from data obtained by means of DNA sequencing is a challenging problem encountered in a variety of applications including single individual haplotyping and studies of viral communities. High-throughput DNA sequencing platforms oversample mixture components to provide massive amounts of reads whose relative positions can be determined by mapping the reads to a known reference genome; assembly of the components, however, requires discovery of the reads’ origin – an NP-hard problem that the existing methods struggle to solve with the required level of accuracy. In this paper, we present a learning framework based on a graph auto-encoder designed to exploit structural properties of sequencing data. The algorithm is a neural network which essentially trains to ignore sequencing errors and infers the posterior probabilities of the origin of sequencing reads. Mixture components are then reconstructed by finding consensus of the reads determined to originate from the same genomic component. Results on realistic synthetic as well as experimental data demonstrate that the proposed framework reliably assembles haplotypes and reconstructs viral communities, often significantly outperforming state-of-the-art techniques. Source codes and datasets are publicly available at https://github.com/WuLoli/GAEseq.


2013 ◽  
Vol 30 (4) ◽  
pp. 409-415
Author(s):  
Zexuan Zhu ◽  
Yongpeng Zhang ◽  
Zhuhong You ◽  
Liang Jiang ◽  
Zhen Ji

PLoS ONE ◽  
2016 ◽  
Vol 11 (5) ◽  
pp. e0155461 ◽  
Author(s):  
José M. Abuín ◽  
Juan C. Pichel ◽  
Tomás F. Pena ◽  
Jorge Amigo

Sign in / Sign up

Export Citation Format

Share Document