# Finding approximate repetitions under Hamming distance

1 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Mots-clés :
Document type :
Journal articles
Domain :

https://hal.inria.fr/inria-00099592
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 9:39:07 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM

### Identifiers

• HAL Id : inria-00099592, version 1

### Citation

Roman Kolpakov, Gregory Kucherov. Finding approximate repetitions under Hamming distance. Theoretical Computer Science, Elsevier, 2003, 303 (1), pp.135-156. ⟨inria-00099592⟩

Record views