Compacting de Bruijn graphs from sequencing data quickly and in low memory

Motivation: As the quantity of data per sequencing experiment increases, the challenges of fragment assembly are becoming increasingly computational. The de Bruijn graph is a widely used data structure in fragment assembly algorithms, used to represent the information from a set of reads. Compaction...

Descripción completa

Detalles Bibliográficos
Autores principales: Chikhi, Rayan, Limasset, Antoine, Medvedev, Paul
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2016
Materias:
Ismb 2016 Proceedings July 8 to July 12, 2016, Orlando, Florida
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4908363/
https://www.ncbi.nlm.nih.gov/pubmed/27307618
http://dx.doi.org/10.1093/bioinformatics/btw279

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4908363/
https://www.ncbi.nlm.nih.gov/pubmed/27307618
http://dx.doi.org/10.1093/bioinformatics/btw279

Ejemplares similares