DSK: K-mer counting with very low memory usage

Bioinformatics

Volumn 29, Issue 5, 2013, Pages 652-653

  Rizk, Guillaume ^a   Lavenier, Dominique ^b   Chikhi, Rayan ^b  

^a Algorizk   (France)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; DNA SEQUENCE; HUMAN; HUMAN GENOME; METHODOLOGY; SEQUENCE ANALYSIS;

ALGORITHMS; GENOME, HUMAN; HUMANS; SEQUENCE ANALYSIS, DNA; SEQUENCE ANALYSIS, RNA; SOFTWARE;

EID: 84874741072     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btt020     Document Type: Article

References (2)

1. Marçais, H. and Kingsford, C. (2011) A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics, 27, 764-770.
2. Melsted, P. and Pritchard, J. (2011) Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinformatics, 12, 333.