# 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 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}.
Keywords :
Document type :
Conference papers
Domain :
Complete list of metadata

https://hal.inria.fr/inria-00100491
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:46:13 PM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM

### Identifiers

• HAL Id : inria-00100491, version 1

### Citation

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⟩

Record views