Article

Coverage-preserving sparsification of overlap graphs for long-read assembly

2022-03-19

Abstract excerpt

Read-overlap-based graph data structures play a central role in computing de novo genome assembly using long reads. Many assembly tools use the string graph model [Myers, Bioinformatics 2005] to sparsify overlap graphs. Graph sparsification improves accuracy by removing spurious and redundant connections. However, a graph model must be coverage-preserving, i.e., it must ensure that each chromosome can be spelled...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work: 00deb5ad-7ce5-5de8-9629-9777a1de399e
DOI: 10.1101/2022.03.17.484715

Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest

Coverage-preserving sparsification of overlap graphs for long-read assemblyDOI 10.1101/2022.03.17.484715Read

Telomere-to-telomere assembly by preserving contained readsSemantic proximity Read

ntJoin: Fast and lightweight assembly-guided scaffolding using minimizer graphsSemantic proximity Read

Memory efficient assembly of human genome.Semantic proximity Read

SpLitteR: Diploid genome assembly using TELL-Seq linked-reads and assembly graphsSemantic proximity Read

Automatic Generation of Model Sequences for Complex Regions in Assembly GraphsSemantic proximity Read

LJA: Assembling Long and Accurate Reads Using Multiplex de Bruijn GraphsSemantic proximity Read

GraphSlimmer: Preserving Read Mappability with the Minimum Number of Variants.Semantic proximity Read

Phased Genome Assemblies.Semantic proximity Read

Haplotype-aware sequence alignment to pangenome graphsSemantic proximity Read

Co-linear Chaining on Pangenome GraphsSemantic proximity Read

Next generation cluster editingSemantic proximity Read

GAPPadder: A Sensitive Approach for Closing Gaps on Draft Genomes with Short Sequence ReadsSemantic proximity Read