Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs

BACKGROUND: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories - based on the data structures which they employ. The first class uses an overlap/strin...

Descripción completa

Detalles Bibliográficos
Autores principales: Kundeti, Vamsi K, Rajasekaran, Sanguthevar, Dinh, Hieu, Vaughn, Matthew, Thapar, Vishal
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2010
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2996408/
https://www.ncbi.nlm.nih.gov/pubmed/21078174
http://dx.doi.org/10.1186/1471-2105-11-560

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2996408/
https://www.ncbi.nlm.nih.gov/pubmed/21078174
http://dx.doi.org/10.1186/1471-2105-11-560

Ejemplares similares