Abstract : The problem of computing tandem repetitions 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 ($S$ the size of the output). This improves, in particular, the bound obtained in \cite{LS93}.
Roman Kolpakov, Gregory Kucherov. Finding Approximate Repetitions under Hamming Distance. 9th European Symposium on Algorithms - ESA 2001, Aug 2001, Aarhus, Denmark, pp.170 -- 181. ⟨inria-00100491⟩