Cargando…
Coverage-preserving sparsification of overlap graphs for long-read assembly
MOTIVATION: Read-overlap-based graph data structures play a central role in computing de novo genome assembly. Most long-read assemblers use Myers’s string graph model to sparsify overlap graphs. Graph sparsification improves assembly contiguity by removing spurious and redundant connections. Howeve...
Autor principal: | Jain, Chirag |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10132763/ https://www.ncbi.nlm.nih.gov/pubmed/36892439 http://dx.doi.org/10.1093/bioinformatics/btad124 |
Ejemplares similares
-
Fast Community Detection with Graph Sparsification
por: Laeuchli, Jesse
Publicado: (2020) -
Topology-based sparsification of graph annotations
por: Danciu, Daniel, et al.
Publicado: (2021) -
Faster Cut Sparsification of Weighted Graphs
por: Forster, Sebastian, et al.
Publicado: (2022) -
On the combinatorics of sparsification
por: Huang, Fenix WD, et al.
Publicado: (2012) -
OGRE: Overlap Graph-based metagenomic Read clustEring
por: Balvert, Marleen, et al.
Publicado: (2020)