A fast, lock-free approach for efficient parallel counting of occurrences of k-mers

Motivation: Counting the number of occurrences of every k -mer (substring of length k ) in a long string is a central subproblem in many applications, including genome assembly, error correction of...