Using cascading Bloom filters to improve the memory usage for de Brujin graphs

Abstract : 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, we show how to reduce the memory required by the data structure of Chikhi and Rizk (WABI'12) that represents de Brujin graphs using Bloom filters. Our method requires 30% to 40% less memory with respect to their method, with insignificant impact on construction time. At the same time, our experiments showed a better query time compared to the method of Chikhi and Rizk.
Conclusion
The proposed data structure constitutes, to our knowledge, currently the most efficient practical representation of de Bruijn graphs.
Type de document :
Article dans une revue
Algorithms for Molecular Biology, BioMed Central, 2014, 9 (1), pp.2. 〈10.1186/1748-7188-9-2〉
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00971576
Contributeur : Ed. Bmc <>
Soumis le : jeudi 3 avril 2014 - 09:27:37
Dernière modification le : mardi 16 janvier 2018 - 15:51:10
Document(s) archivé(s) le : jeudi 3 juillet 2014 - 11:06:09

Fichiers

1748-7188-9-2.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov. Using cascading Bloom filters to improve the memory usage for de Brujin graphs. Algorithms for Molecular Biology, BioMed Central, 2014, 9 (1), pp.2. 〈10.1186/1748-7188-9-2〉. 〈hal-00971576〉

Partager

Métriques

Consultations de la notice

474

Téléchargements de fichiers

137