Cargando…
Cuttlefish: fast, parallel and low-memory compaction of de Bruijn graphs from large-scale genome collections
MOTIVATION: The construction of the compacted de Bruijn graph from collections of reference genomes is a task of increasing interest in genomic analyses. These graphs are increasingly used as sequence indices for short- and long-read alignment. Also, as we sequence and assemble a greater diversity o...
Autores principales: | Khan, Jamshed, Patro, Rob |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8275350/ https://www.ncbi.nlm.nih.gov/pubmed/34252958 http://dx.doi.org/10.1093/bioinformatics/btab309 |
Ejemplares similares
-
Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2
por: Khan, Jamshed, et al.
Publicado: (2022) -
A space and time-efficient index for the compacted colored de Bruijn graph
por: Almodaresi, Fatemeh, et al.
Publicado: (2018) -
Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs
por: Holley, Guillaume, et al.
Publicado: (2020) -
Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
por: Cracco, Andrea, et al.
Publicado: (2023) -
Compacting de Bruijn graphs from sequencing data quickly and in low memory
por: Chikhi, Rayan, et al.
Publicado: (2016)