k-mers are substrings of length k inside of a larger string.
1-mer counting would just be counting up each occurance of G, T, A, and C.
3-mers
We break the string into small k-mers (say, 3-mers) We sort those chunks in a hash table We use the index to find seeds, where the string match perfectly Then we