2018
DOI: 10.1093/bioinformatics/bty279
|View full text |Cite
|
Sign up to set email alerts
|

A graph-based approach to diploid genome assembly

Abstract: MotivationConstructing high-quality haplotype-resolved de novo assemblies of diploid genomes is important for revealing the full extent of structural variation and its role in health and disease. Current assembly approaches often collapse the two sequences into one haploid consensus sequence and, therefore, fail to capture the diploid nature of the organism under study. Thus, building an assembler capable of producing accurate and complete diploid assemblies, while being resource-efficient with respect to sequ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
58
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
3
2

Relationship

3
5

Authors

Journals

citations
Cited by 62 publications
(60 citation statements)
references
References 52 publications
2
58
0
Order By: Relevance
“…It is likely that improved alignment methods will lead to improved results here as well, and we are currently investigating this further. Lastly, GraphAligner might enable scaling the haplotype-resolved genome assembly method that we demonstrated for yeast genomes [11] to mammalian genomes.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…It is likely that improved alignment methods will lead to improved results here as well, and we are currently investigating this further. Lastly, GraphAligner might enable scaling the haplotype-resolved genome assembly method that we demonstrated for yeast genomes [11] to mammalian genomes.…”
Section: Discussionmentioning
confidence: 99%
“…Graphs provide a natural way of expressing variation or uncertainty in a genome [1,2]. They have been used for diverse applications such as genome assembly [3,4,5], error correction [6,7,8], short tandem repeat genotyping [9], structural variation genotyping [10] and reference-free haplotype reconstruction [11]. With the growing usage of graphs, methods for handling graphs efficiently are becoming a crucial requirement for many applications.…”
Section: Introductionmentioning
confidence: 99%
“…This problem is exacerbated in highly heterozygous genomes, resulting in fragmented and inflated assemblies which impede downstream analyses [3,4]. Furthermore, a consensus sequence does not represent either true, parental haplotype, leading to loss of haplotype-specific information such as allelic and structural variants [5]. Whilst reducing heterozygosity by inbreeding has been a frequent approach, rearing inbred lines is unfeasible and highly time consuming for many non-model systems, and resulting genomes may no longer be representative of wild populations.…”
Section: Data Description Backgroundmentioning
confidence: 99%
“…However, the methods described above collapse differences between homologous pairs into a single consensus sequence, without regards for the rich information given by the layout of different alleles along two DNA strands (Simpson and Pop, 2015). By contrast, other assemblers by Chin et al (2016); Garg et al (2018); Weisenfeld et al (2017) have been developed to generate haplotigs, haplotype-resolves assemblies for diploid genomes.…”
Section: Introductionmentioning
confidence: 99%
“…Given a pedigree graph containing a series of bubbles, long-read (PacBio) data from each individual are threaded through it; in essence, the most probable paths that the long reads trace through the bubbles in our pedigree graph, and which obey the Mendelian constraints imposed by the pedigree, represent our true haplotypes. We draw key concepts from the graph-based assembly approach for single individuals described in Garg et al (2018) and the PedMEC formulation set forth in Garg et al (2016), yet synthesize and extend them to overcome their respective shortcomings.…”
Section: Introductionmentioning
confidence: 99%