Finding Approximate Repetitions under Hamming Distance - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2001

Finding Approximate Repetitions under Hamming Distance

Résumé

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}.

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00100491 , version 1

Citer

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⟩
206 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More