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

Rajat Shuvro Roy, Debashish Bhattacharya, Alexander Schliep

Counting the frequencies of k-mers in read libraries is often a first step in the analysis of high-throughput sequencing experiments. Infrequent k-mers are assumed to be a result o…