Finding approximate repetitions under Hamming distance - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) 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 \citeLS93. Finally, other possible definions are briefly analyzed.}

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4163.pdf (317.04 Ko) Télécharger le fichier

Dates et versions

inria-00072459 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00072459 , version 1

Citer

Roman Kolpakov, Gregory Kucherov. Finding approximate repetitions under Hamming distance. [Research Report] RR-4163, INRIA. 2001, pp.30. ⟨inria-00072459⟩
438 Consultations
306 Téléchargements

Partager

Gmail Facebook X LinkedIn More