Finding approximate repetitions under Hamming distance
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 \citeLS93. Finally, other possible definions are briefly analyzed.}