A fast, lock-free approach for efficient parallel counting of occurrences of <i>k</i> -mers
Abstract 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 as...