Finding approximate repetitions under Hamming distance
Résumé
The problem of computing periodicities with $K$ possible mismatches is studied. Two main definitions are considered, and for both of them an $O(nK\log K+S)$ algorithm is proposed ($n$ the word length and $S$ the size of the output). This improves, in particular, the bound obtained in \cite{LS93}. Finally, other possible definitions are briefly analyzed.