Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs

Kamil Salikhov(Lomonosov Moscow State University), Gustavo Sacomoto(Université Claude Bernard Lyon 1), Grégory Kucherov(Centre National de la Recherche Scientifique)
Lecture notes in computer science
January 1, 2013
10.1007/978-3-642-40453-5_28
Cited by 44Open Access
Full Text

Abstract

Related Papers

Full-length transcriptome assembly from RNA-Seq data without a reference genome
Manfred Grabherr, Brian J. Haas, Moran Yassour et al.|Nature Biotechnology|2011|22.5k
The Complete Genome Sequence of <i>Escherichia coli</i> K-12
Frederick R. Blattner, Guy Plunkett, Craig A. Bloch et al.|Science|1997|7.5k
An Eulerian path approach to DNA fragment assembly
Pavel A. Pevzner, Haixu Tang, Michael S. Waterman|Proceedings of the National Academy of Sciences|2001|1.4k
Assembly algorithms for next-generation sequencing data
Jason Miller, Sergey Koren, Granger Sutton|Genomics|2010|1.2k
De novo assembly and genotyping of variants using colored de Bruijn graphs
Zamin Iqbal, Mario Cáccamo, Isaac Turner et al.|Nature Genetics|2012|715