Cargando…
Space-efficient and exact de Bruijn graph representation based on a Bloom filter
BACKGROUND: The de Bruijn graph data structure is widely used in next-generation sequencing (NGS). Many programs, e.g. de novo assemblers, rely on in-memory representation of this graph. However, current techniques for representing the de Bruijn graph of a human genome require a large amount of memo...
Autores principales: | Chikhi, Rayan, Rizk, Guillaume |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3848682/ https://www.ncbi.nlm.nih.gov/pubmed/24040893 http://dx.doi.org/10.1186/1748-7188-8-22 |
Ejemplares similares
-
deBGR: an efficient and near-exact representation of the weighted de Bruijn graph
por: Pandey, Prashant, et al.
Publicado: (2017) -
Efficient High-Quality Metagenome Assembly from Long Accurate Reads using Minimizer-space de Bruijn Graphs
por: Benoit, Gaëtan, et al.
Publicado: (2023) -
Simplitigs as an efficient and scalable representation of de Bruijn graphs
por: Břinda, Karel, et al.
Publicado: (2021) -
Compacting de Bruijn graphs from sequencing data quickly and in low memory
por: Chikhi, Rayan, et al.
Publicado: (2016) -
A space and time-efficient index for the compacted colored de Bruijn graph
por: Almodaresi, Fatemeh, et al.
Publicado: (2018)