Space-efficient and exact de Bruijn graph representation based on a Bloom filter

Algorithms for Molecular Biology

Volumn 8, Issue 1, 2013, Pages

  Chikhi, Rayan ^a   Rizk, Guillaume ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b Algorizk   (France)

Author keywords

Bloom filter; De Bruijn graph; De novo assembly

Indexed keywords

MEASLES VIRUS;

EID: 84883784774     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/1748-7188-8-22     Document Type: Article

References (23)

1. Idury RM, Waterman MS. A new algorithm for DNA sequence assembly. J Comput Biol 1995, 2(2):291-306. 10.1089/cmb.1995.2.291, 7497130.
2. Grabherr MG. Full-length transcriptome assembly from RNA-Seq data without a reference genome. Nat Biotech 2011, 29(7):644-652. [http://dx.doi.org/10.1038/nbt.1883].
3. Peng Y, Leung HCM, Yiu SM, Chin FYL. Meta-IDBA: a de Novo assembler for metagenomic data. Bioinformatics 2011, 27(13):i94-i101. 10.1093/bioinformatics/btr216, 3117360, 21685107.
4. Peterlongo P, Schnel N, Pisanti N, Sagot MF, Lacroix V. Identifying SNPs without a reference genome by comparing raw reads. String Processing and Information Retrieval 2010, 147-158. Berlin, Heidelberg: Springer.
5. Iqbal Z, Caccamo M, Turner I, Flicek P, McVean G. De novo assembly and genotyping of variants using colored de Bruijn graphs. Nat Genet 2012, 44:226-232. 10.1038/ng.1028, 3272472, 22231483.
6. Sacomoto G, Kielbassa J, Chikhi R, Uricaru R, Antoniou P, Sagot M, Peterlongo P, Lacroix V. KISSPLICE: de-novo calling alternative splicing events from RNA-seq data. BMC Bioinformatics 2012, 13(Suppl 6):S5. [http://www.biomedcentral.com/1471-2105/13/S6/S5], 3426807, 23320920.
7. Li R, Zhu H, Ruan J, Qian W, Fang X, Shi Z, Li Y, Li S, Shan G, Kristiansen K. De novo assembly of human genomes with massively parallel short read sequencing. Genome Res 2010, 20(2):265. 10.1101/gr.097261.109, 2813482, 20019144.
8. Simpson JT, Wong K, Jackman SD, Schein JE, Jones SJM, Birol I. ABySS: A parallel assembler for short read sequence data. Genome Res 2009, 19(6):1117-1123. [http://genome.cshlp.org/content/19/6/1117.abstract], 10.1101/gr.089532.108, 2694472, 19251739.
9. Conway TC, Bromage AJ. Succinct data structures for assembling large genomes. Bioinformatics 2011, 27(4):479. 10.1093/bioinformatics/btq697, 21245053.
10. Warren RL, Holt RA. Targeted assembly of short sequence reads. PloS One 2011, 6(5):e19816. 10.1371/journal.pone.0019816, 3092772, 21589938.
11. Peterlongo P, Chikhi R. Mapsembler, targeted and micro assembly of large NGS datasets on a desktop computer. BMC Bioinformatics 2012, 13:48. 10.1186/1471-2105-13-48, 3514201, 22443449.
12. Ye C, Ma Z, Cannon C, Pop M, Yu D. Exploiting sparseness in de novo genome assembly. BMC Bioinformatics 2012, 13(Suppl 6):S1. [http://www.biomedcentral.com/1471-2105/13/S6/S1], 10.1186/1471-2105-13-S6-S1, 23346590.
13. Pell J, Hintze A, Canino-Koning R, Howe A, Tiedje JM, Brown CT. Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Arxiv preprint arXiv:1112.4193 2011,
14. Kirsch A, Mitzenmacher M. Less hashing, same performance: Building a better Bloom filter. Algorithms-ESA 2006, 4168:456-467.
15. Miller JR, Koren S, Sutton G. Assembly algorithms for next-generation sequencing data. Genomics 2010, 95(6):315-327. 10.1016/j.ygeno.2010.03.001, 2874646, 20211242.
16. Chikhi R, Lavenier D. Localized genome assembly from reads to scaffolds: practical traversal of the paired string graph. Algo Bioinformatics 2011, 6833:39-48.
17. Kingsford C, Schatz MC, Pop M. Assembly complexity of prokaryotic genomes using short reads. BMC Bioinformatics 2010, 11:21. 10.1186/1471-2105-11-21, 2821320, 20064276.
18. Marçais G, Kingsford C. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 2011, 27(6):764-770. [http://bioinformatics.oxfordjournals.org/content/27/6/764.abstract], 10.1093/bioinformatics/btr011, 3051319, 21217122.
19. Rizk G, Lavenier D, Chikhi R. DSK: k-mer counting with very low memory usage. Bioinformatics 2013, 29(5):652-653. 10.1093/bioinformatics/btt020, 23325618.
20. Rizk G, Lavenier D. GASSST: global alignment short sequence search tool. Bioinformatics 2010, 26(20):2534. 10.1093/bioinformatics/btq485, 2951093, 20739310.
21. Salzberg SL, Phillippy AM, Zimin A, Puiu D, Magoc T, Koren S, Treangen TJ, Schatz MC, Delcher AL, Roberts M, Marçais G, Pop M, Yorke JA. GAGE: A critical evaluation of genome assemblies and assembly algorithms. Genome Res 2012, 22(3):557-567. [http://genome.cshlp.org/content/22/3/557.abstract], 10.1101/gr.131383.111, 3290791, 22147368.
22. Chazelle B, Kilian J, Rubinfeld R, Tal A. The Bloomier filter: an efficient data structure for static support lookup tables. Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2004, 30-39. Philadelphia: SIAM.
23. Bowe A, Onodera T, Sadakane K, Shibuya T. Succinct de Bruijn Graphs. Algorithms in Bioinformatics, Volume 7534 of Lecture Notes in Computer Science 2012, 225-235. Berlin, Heidelberg: Springer, Raphael B, Tang J, [http://dx.doi.org/10.1007/978-3-642-33122-0_18].