These are not the K-mers you are looking for: Efficient online K-mer counting using a probabilistic data structure

PLoS ONE

Volumn 9, Issue 7, 2014, Pages

  Zhang, Qingpeng ^a   Pell, Jason ^a   Canino Koning, Rosangela ^a   Howe, Adina Chuang ^b,c   Brown, C Titus ^a,b  

^a Michigan State University   (United States)

^b Department of Microbiology and Molecular Genetics Michigan State University ^*  (United States)

^c MICHIGAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS TO INFORMATION; ANALYTICAL ERROR; ARTICLE; BIOINFORMATICS; COMPUTER ANALYSIS; COMPUTER INTERFACE; COMPUTER MEMORY; COMPUTER SYSTEM; CONTROLLED STUDY; DATA ANALYSIS SOFTWARE; INTERMETHOD COMPARISON; K MER COUNTING; ONLINE ANALYSIS; ONLINE SYSTEM; PROBABILITY; ALGORITHM; BIOLOGY; COMPUTER PROGRAM; DNA SEQUENCE; HUMAN;

NUCLEOTIDE;

ALGORITHMS; COMPUTATIONAL BIOLOGY; HUMANS; NUCLEOTIDES; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84904876565     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0101271     Document Type: Article

References (40)

1. Marçais G, Kingsford C (2011) A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 27: 764-770.
2. Kurtz S, Narechania A, Stein JC, Ware D (2008) A new method to compute Kmer frequencies and its application to annotate large repetitive plant genomes. BMC Genomics 9: 517.
3. Metzker M (2010) Sequencing technologies - the next generation. Nat Rev Genet 11: 31-46.
4. Conway TC, Bromage AJ (2011) Succinct data structures for assembling large genomes. Bioinfor-matics 27: 479-86.
5. Minoche AE, Dohm JC, Himmelbauer H (2011) Evaluation of genomic high-throughput sequencing data generated on illumina hiseq and genome analyzer systems. Genome Biol 12: R112.
6. Melsted P, Pritchard JK (2011) Efficient counting of k-mers in DNA sequences using a bloom filter. BMC bioinformatics 12: 333.
7. Rizk G, Lavenier D, Chikhi R (2013) Dsk: k-mer counting with very low memory usage. Bioinfor- matics 29: 652-3.
8. Deorowicz S, Debudaj-Grabysz A, Grabowski S (2013) Disk-based k-mer counting on a pc. BMC Bioinformatics 14: 160.
9. Roy RS, Bhattacharya D, Schliep A (2014) Turtle: Identifying frequent k-mers with cache-efficient algorithms. Bioinformatics: Advance Access published March 10, 2014 : doi: 10.1093/bioinformat-ics/btu132.
10. Audano P, Vannberg F (2014) Kanalyze: A fast versatile pipelined k-mer toolkit. Bioinformatics: Advance Access published March 18, 2014: doi: 10.1093/bioinformatics/btu152.
11. Howe AC, Jansson JK, Malfatti SA, Tringe SG, Tiedje JM, et al. (2014) Tackling soil diversity with the assembly of large, complex metagenomes. Proc Natl Acad Sci U S A 111: 4904-9.
12. Cormode G, Muthukrishnan S (2005) An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms 55: 58-75. (Pubitemid 40357145)
13. Bloom BH (1970) Space/time trade-offs in hash coding with allowable errors. Commun ACM 13: 422-426.
14. Malde K, O'Sullivan B (2009) Using bloom filters for large scale gene sequence analysis in haskell. In: Gill A, Swift T, editors, PADL. Springer, volume 5418 of Lecture Notes in Computer Science, pp. 183-194.
15. Pell J, Hintze A, Canino-Koning R, Howe A, Tiedje JM, et al. (2012) Scaling metagenome sequence assembly with probabilistic de bruijn graphs. Proc Natl Acad Sci U S A 109: 13272-7.
16. Jones DC, Ruzzo WL, Peng X, Katze MG (2012) Compression of nextgeneration sequencing reads aided by highly efficient de novo assembly. Nucleic Acids Res 40: e171.
17. Broder AZ, Mitzenmacher M (2003) Survey: Network applications of bloom filters: A survey. Internet Mathematics 1: 485-509.
18. Fan L, Cao P, Almeida J, Broder AZ (2000) Summary cache: A scalable wide-area web cache sharing protocol. IEEE/ACM Trans Netw 8: 281-293.
19. Estan C, Varghese G (2002) New directions in traffic measurement and accounting. In: SIGCOMM. ACM, pp. 323-336. (Pubitemid 43843793)
20. Cohen S, Matias Y (2003) Spectral bloom filters. In: Halevy AY, Ives ZG, Doan A, editors, SIGMOD Conference. ACM, pp. 241-252.
21. Brown CT, Howe A, Zhang Q, Pyrkosz AB, Brom TH (2012) A reference-free algorithm for com- putational normalization of shotgun sequencing data. arXiv: 1203.4802.
22. Crusoe M, Edvenson G, Fish J, Howe A, McDonald E, et al. (2014) The khmer software package: enabling efficient sequence analysis. URL http://dx.doi.org/10.6084/m9.figshare.979190.
23. McDonald E, Brown CT (2013) Working with big data in bioinformatics. In: Armstrong T, editor, The Performance of Open Source Applications, lulu.com, chapter 12. p. 151.
24. Broder A, Mitzenmacher M (2004) Network applications of bloom filters: A survey. Internet mathematics 1: 485-509.
25. Flajolet P, Fusy É, Gandouet O, Meunier F (2008) Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. DMTCS Proceedings.
26. Chikhi R, Medvedev P (2014) Informed and automated k-mer size selection for genome assembly. Bioinformatics 30: 31-7.
27. Medvedev P, Scott E, Kakaradov B, Pevzner P (2011) Error correction of high-throughput se- quencing datasets with non-uniform coverage. Bioinformatics 27: i137-41.
28. Pevzner PA, Tang H, Waterman MS (2001) An eulerian path approach to dna fragment assembly. Proc Natl Acad Sci U S A 98: 9748-53. (Pubitemid 32769375)
29. Li X, Waterman MS (2003) Estimating the repeat structure and length of dna sequences using l-tuples. Genome Res 13: 1916-22. (Pubitemid 36987198)
30. Kelley DR, Schatz MC, Salzberg SL (2010) Quake: quality-aware detection and correction of sequencing errors. Genome Biol 11: R116.
31. Chitsaz H, Yee-Greenbaum J, Tesler G, Lombardo M, Dupont C, et al. (2011) Efficient de novo assembly of single-cell bacterial genomes from short-read data sets. Nat Biotechnol 29: 915-21.
32. Haas BJ, Papanicolaou A, Yassour M, Grabherr M, Blood PD, et al. (2013) De novo transcript sequence reconstruction from rna-seq using the trinity platform for reference generation and analysis. Nat Protoc 8: 1494-512.
33. Brown CT (2012) What does trinity's in silico normalization do? URL http://dx.doi.org/10.6084/m9.figshare.98198.
34. Zerbino DR, Birney E (2008) Velvet: algorithms for de novo short read assembly using de bruijn graphs. Genome Res 18: 821-9. (Pubitemid 351645072)
35. Rusu F, Dobra A (2008) Sketches for size of join estimation. ACM Transactions on Database Systems 33: 1-46.
36. Cormode G, Muthukrishnan S (2005) Summarizing and mining skewed data streams. In: Kargupta H, Srivastava J, Kamath C, Goodman A, editors, SDM. SIAM, pp. 44-55.
37. Luo W, Friedman MS, Shedden K, Hankenson KD, Woolf PJ (2009) Gage: generally applicable gene set enrichment for pathway analysis. BMC Bioinformatics 10: 161.
38. Howe AC, Pell J, Canino-Koning R, Mackelprang R, Tringe S, et al. (2012) Illumina sequencing artifacts revealed by connectivity analysis of metagenomic datasets. arXiv: 1212.0159.
39. Pérez F, Granger B (2007) Ipython: A system for interactive scientific computing. Computing in Science Engineering 9: 21-29. (Pubitemid 46646861)
40. Qin J, Li R, Raes J, Arumugam M, Burgdorf KS, et al. (2010) A human gut microbial gene catalogue established by metagenomic sequencing. Nature 464: 59-65.