Cargando…
Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT
Compacted de Bruijn graphs are one of the most fundamental data structures in computational genomics. Colored compacted de Bruijn graphs are a variant built on a collection of sequences and associate to each k-mer the sequences in which it appears. We present GGCAT, a tool for constructing both type...
Autores principales: | Cracco, Andrea, Tomescu, Alexandru I. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Cold Spring Harbor Laboratory Press
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10538363/ https://www.ncbi.nlm.nih.gov/pubmed/37253540 http://dx.doi.org/10.1101/gr.277615.122 |
Ejemplares similares
-
Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2
por: Khan, Jamshed, et al.
Publicado: (2022) -
Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs
por: Holley, Guillaume, et al.
Publicado: (2020) -
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)