Conceptual

K-mers: Fixed-Length Substrings as the Unit of Sequence Comparison

Decomposing a sequence into overlapping length-k substrings turns approximate sequence comparison into exact hashing and set operations. Choice of k trades specificity against tolerance of error and repeats.