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

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