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}.
F.Meyer auf der Heide. 9th European Symposium on Algorithms - ESA 2001, Aug 2001, Aarhus, Denmark, Springer, 2161, pp.170 -- 181, 2001, Lecture Notes in Computer Science
https://hal.inria.fr/inria-00100491
Contributeur : Publications Loria
<>
Soumis le : mardi 26 septembre 2006 - 14:46:13
Dernière modification le : mardi 6 mars 2018 - 17:40:58
Roman Kolpakov, Gregory Kucherov. Finding Approximate Repetitions under Hamming Distance. F.Meyer auf der Heide. 9th European Symposium on Algorithms - ESA 2001, Aug 2001, Aarhus, Denmark, Springer, 2161, pp.170 -- 181, 2001, Lecture Notes in Computer Science. 〈inria-00100491〉
