Finding approximate repetitions under Hamming distance - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2003

Finding approximate repetitions under Hamming distance

Roman Kolpakov
  • Function : Author

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.

Domains

Other [cs.OH]

Dates and versions

inria-00099592 , version 1 (26-09-2006)

Identifiers

Cite

Roman Kolpakov, Gregory Kucherov. Finding approximate repetitions under Hamming distance. Theoretical Computer Science, 2003, 303 (1), pp.135-156. ⟨10.1016/S0304-3975(02)00448-6⟩. ⟨inria-00099592⟩
130 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More