Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2

The de Bruijn graph is a key data structure in modern computational genomics, and construction of its compacted variant resides upstream of many genomic analyses. As the quantity of genomic data grows rapidly, this often forms a computational bottleneck. We present Cuttlefish 2, significantly advanc...

Descripción completa

Detalles Bibliográficos
Autores principales: Khan, Jamshed, Kokot, Marek, Deorowicz, Sebastian, Patro, Rob
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2022
Materias:
Method
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9454175/
https://www.ncbi.nlm.nih.gov/pubmed/36076275
http://dx.doi.org/10.1186/s13059-022-02743-6

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9454175/
https://www.ncbi.nlm.nih.gov/pubmed/36076275
http://dx.doi.org/10.1186/s13059-022-02743-6

Ejemplares similares