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...

Descripción completa

Detalles Bibliográficos
Autor principal: Jain, Chirag
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2023
Materias:
Original Paper
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

Internet

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