Turtle: Identifying frequent k-mers with cache-efficient algorithms

Bioinformatics

Volumn 30, Issue 14, 2014, Pages 1950-1957

  Roy, Rajat Shuvro ^a,b   Bhattacharya, Debashish ^a,b   Schliep, Alexander ^a,c  

^a Department of Computer Science ^*  (United States)

^b Institute of Marine and Coastal Sciences   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; DNA SEQUENCE; HIGH THROUGHPUT SEQUENCING; HUMAN; HUMAN GENOME; METHODOLOGY;

ALGORITHMS; GENOME, HUMAN; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84904013350     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btu132     Document Type: Article

References (24)

1. Bankevich, A. et al. (2012) Spades: a new genome assembly algorithm and its applications to single-cell sequencing. J. Comput. Biol., 19, 455-477.
2. Bender, M.A. et al. (2005) Cache-oblivious b-trees. SIAM J. Comput., 35, 341-358.
3. Bloom, B.H. (1970) Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13, 422-426.
4. Chikhi, R. and Rizk, G. (2012) Space-efficient and exact de Bruijn graph representation based on a Bloom filter. In: Raphael, B. and Tang, T. (eds) Algorithms in Bioinformatics, volume 7534 of Lecture Notes in Computer Science. Springer, Berlin, Heidelberg, pp. 236-248.
5. Chitsaz, H. et al. (2011) Efficient de novo assembly of single-cell bacterial genomes from short-read data sets. Nat. Biotechnol., 29, 915-921.
6. Deorowicz, S. et al. (2013) Disk-based k-mer counting on a PC. BMC Bioinformatics, 14, 160.
7. Fan, L. et al. (2000) Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans. Netw., 8, 281-293.
8. Jaffe, D.B. et al. (2003) Whole-genome sequence assembly for mammalian genomes: Arachne 2. Genome Res., 13, 91-96.
9. Kelley, D.R. et al. (2010) Quake: quality-aware detection and correction of sequencing errors. Genome Biol., 11, R116.
10. Levinthal, D. (2008) Performance analysis guide for Intel Core i7 processor and intel xeon 5500 processors.
11. Liu, Y. et al. (2012) Musket: a multistage k-mer spectrum based error corrector for illumina sequence data. Bioinformatics, 29, 308-315.
12. Marcais, G. and Kingsford, C. (2011) A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics, 27, 764-770.
13. Medvedev, P. et al. (2011) Error correction of high-throughput sequencing datasets with non-uniform coverage. Bioinformatics, 27, i137-i141.
14. Melsted, P. and Pritchard, J.K. (2011) Efficient counting of k-mers in DNA sequences using a Bloom filter. BMC Bioinformatics, 12, 333.
15. Miller, J.R. et al. (2008) Aggressive assembly of pyrosequencing reads with mates. Bioinformatics, 24, 2818-2824.
16. Patterson, D.A. and Hennessey, J.L. (1998) Computer Organization and Design: the Hardware/Software Interface. 2nd edn. Morgan Kaufmann Publishers, Inc., San Francisco, CA.
17. Pell, J. et al. (2012) Scaling metagenome sequence assembly with probabilistic de Bruijn graphs. Proc. Natl Acad. Sci. USA, [Epub ahead of print, doi:10.1073/pnas.1121464109, June 26, 2012].
18. Pevzner, P.A. et al. (2001) An Eulerian path approach to DNA fragment assembly. Proc. Natl Acad. Sci. USA, 98, 9748-9753.
19. Putze, F. et al. (2010) Cache-, hash-, and space-efficient Bloom filters. J. Exp. Algorithmics, 14, 4:4.4-4:4.18.
20. Rizk, G. et al. (2013) DSK: k-mer counting with very low memory usage. Bioinformatics, 29, 652-653.
21. Salomon, D. (1997) Data Compression: The Complete Reference. Springer.
22. Simpson, J.T. et al. (2009) Abyss: a parallel assembler for short read sequence data. Genome Res., 19, 1117-1123.
23. Warren, H.S. (2012) Hackers Delight. 2nd edn. Addison-Wesley Professional.
24. Zerbino, D.R. and Birney, E. (2008) Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res., 18, 821-829.