Cargando…
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...
Autores principales: | Khan, Jamshed, Kokot, Marek, Deorowicz, Sebastian, Patro, Rob |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2022
|
Materias: | |
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 |
Ejemplares similares
-
Cuttlefish: fast, parallel and low-memory compaction of de Bruijn graphs from large-scale genome collections
por: Khan, Jamshed, et al.
Publicado: (2021) -
Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
por: Cracco, Andrea, et al.
Publicado: (2023) -
Simplitigs as an efficient and scalable representation of de Bruijn graphs
por: Břinda, Karel, et al.
Publicado: (2021) -
A space and time-efficient index for the compacted colored de Bruijn graph
por: Almodaresi, Fatemeh, et al.
Publicado: (2018) -
deSALT: fast and accurate long transcriptomic read alignment with de Bruijn graph-based index
por: Liu, Bo, et al.
Publicado: (2019)