Longest common substrings with k mismatches

Tomas Flouri, Emanuele Giaquinta, Kassian Kobert +1

The longest common substring with $k$-mismatches problem is to find, given two strings $S_1$ and $S_2$, a longest substring $A_1$ of $S_1$ and $A_2$ of $S_2$ such that the Hamming…