Cargando…
Using cascading Bloom filters to improve the memory usage for de Brujin graphs
BACKGROUND: De Brujin graphs are widely used in bioinformatics for processing next-generation sequencing data. Due to a very large size of NGS datasets, it is essential to represent de Bruijn graphs compactly, and several approaches to this problem have been proposed recently. RESULTS: In this work,...
Autores principales: | Salikhov, Kamil, Sacomoto, Gustavo, Kucherov, Gregory |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3974045/ https://www.ncbi.nlm.nih.gov/pubmed/24565280 http://dx.doi.org/10.1186/1748-7188-9-2 |
Ejemplares similares
-
Fast lossless compression via cascading Bloom filters
por: Rozov, Roye, et al.
Publicado: (2014) -
Space-efficient and exact de Bruijn graph representation based on a Bloom filter
por: Chikhi, Rayan, et al.
Publicado: (2013) -
Improving Bloom Filter Performance on Sequence Data Using k-mer Bloom Filters
por: Pellow, David, et al.
Publicado: (2017) -
Simplitigs as an efficient and scalable representation of de Bruijn graphs
por: Břinda, Karel, et al.
Publicado: (2021) -
Bloom filters for molecules
por: Medina, Jorge, et al.
Publicado: (2023)