Raphaël Clifford

The k-mismatch problem revisited

2015 · arXiv (Cornell University)

We revisit the complexity of one of the most basic problems in pattern matching. In the k-mismatch problem we must compute the Hamming distance between a pattern of length m and every m-length substring of …