A note on the longest common substring with k-mismatches problem
Two new algorithms for the longest common substring with k-mismatches problem. Used techniques of keyword enumeration and sparse dynamic programming, respectively. First subquadratic-time result for small (but greater than 1) k.
longest common substring with k-mismatches combinatorial problems string algorithms word-level parallelism