Compact representation of k-mer de Bruijn graphs for genome read assembly

BMC Bioinformatics

Volumn 14, Issue 1, 2013, Pages

  Rødland, Einar A ^a,b  

^a UNIVERSITY OF OSLO   (Norway)

^b OSLO UNIVERSITY HOSPITAL   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

BURROWS WHEELER TRANSFORM; COMPACT REPRESENTATION; EFFICIENT DATA STRUCTURES; GRAPH REPRESENTATION; HIGH-THROUGHPUT SEQUENCING; JAVA IMPLEMENTATION; MEMORY REQUIREMENTS; TECHNICAL DOCUMENTATIONS;

DATA STRUCTURES; INTERCONNECTION NETWORKS; THROUGHPUT;

GENES;

ALGORITHM; ARTICLE; DNA SEQUENCE; GENOMICS; METHODOLOGY;

ALGORITHMS; GENOMICS; SEQUENCE ANALYSIS, DNA;

EID: 84886036945     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-14-313     Document Type: Article

References (21)

1. Conway TC, Bromage AJ. Succinct data structures for assembling large genomes. Bioinformatics 2011, 27(4):479-486. 10.1093/bioinformatics/btq697, 21245053.
2. Ning Z, Cox AJ, Mullikin JC. SSAHA: a fast search method for large DNA databases. Genome Res 2001, 11(10):1725-1729. 10.1101/gr.194201, 311141, 11591649.
3. Roberts M, Hayes W, Hunt BR, Mount SM, Yorke JA. Reducing storage requirements for biological sequence comparison. Bioinformatics 2004, 20(18):3363-3369. 10.1093/bioinformatics/bth408, 15256412.
4. Ye C, Ma ZS, Cannon CH, Pop M, Yu DW. Exploiting sparseness in de novo genome assembly. BMC Bioinformatics 2012, 13(Suppl 6):S1.
5. Pell J, Hintze A, Canino-Koning R, Howe A, Tiedje JM, Brown CT. Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Proc Natl Acad Sci U S A 2012, 109(33):13272-13277. 10.1073/pnas.1121464109, 3421212, 22847406.
6. Chikhi R, Rizk G. Space-efficient and exact de Bruijn graph representation based on a Bloom filter. Algorithms in Bioinformatics, Lecture Notes in Computer Science 2012, 236-248. Springer, Raphel B, Tang J.
7. Ferragina P, Manzini G. Opportunistic data structures with applications. 41st Annual Symposium on Foundations of Computer Science 2000, 390-398.
8. Burrows M, Wheeler DJ. A block-sorting lossless data compression algorithm. Tech. Rep. May 10, SRC Research Report 1994.
9. Grossi R, Vitter JS. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. STOC '00 Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing 2000, 397-406. New York: ACM.
10. Simpson JT, Durbin R. Efficient de novo assembly of large genomes using compressed data structures. Genome Res 2012, 22(3):549-556. 10.1101/gr.126953.111, 3290790, 22156294.
11. Ferragina P, Manzini G. Indexing compressed text. J ACM 2005, 52(4):552-581.
12. Zerbino DR, Birney E. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res 2008, 18(5):821-829. 10.1101/gr.074492.107, 2336801, 18349386.
13. 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. 10.1101/gr.089532.108, 2694472, 19251739.
14. Kelley DR, Schatz MC, Salzberg SL. Quake: quality-aware detection and correction of sequencing errors. Genome Biol 2010, 11(11):R116. 10.1186/gb-2010-11-11-r116, 3156955, 21114842.
15. Yang X, Dorman KS, Aluru S. Reptile: representative tiling for short read error correction. Bioinformatics 2010, 26(20):2526-2533. 10.1093/bioinformatics/btq468, 20834037.
16. Melsted P, Pritchard JK. Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinformatics 2011, 12:333. 10.1186/1471-2105-12-333, 3166945, 21831268.
17. 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. 10.1093/bioinformatics/btr011, 3051319, 21217122.
18. Liu Y, Schröder J, Schmidt B. Musket: a multistage k-mer spectrum-based error corrector for Illumina sequence data. Bioinformatics 2013, 29(3):308-315. 10.1093/bioinformatics/bts690, 23202746.
19. Nong G, Zhang S, Chan WH. Linear suffix array construction by almost pure induced-sorting. 2009 Data Compression Conference 2009, 193-202. IEEE.
20. Hon WK, Sadakane K, Sung WK. Breaking a time-and-space barrier in constructing full-text indices. SIAM J Comput 2009, 38(6):2162-2178.
21. Okanohara D, Sadakane K. A linear-time burrows-wheeler transform using induced sorting. Lecture Notes Comput Sci: String Process Inf Retrieval 2009, 5721:90-101.