HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

Finding approximate repetitions under Hamming distance

Roman Kolpakov 1 Gregory Kucherov 1
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 \citeLS93. Finally, other possible definions are briefly analyzed.}
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072459
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:01:09 AM
Last modification on : Friday, February 4, 2022 - 3:29:55 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:08:39 PM

Identifiers

  • HAL Id : inria-00072459, version 1

Collections

Citation

Roman Kolpakov, Gregory Kucherov. Finding approximate repetitions under Hamming distance. [Research Report] RR-4163, INRIA. 2001, pp.30. ⟨inria-00072459⟩

Share

Metrics

Record views

435

Files downloads

260