Locating maximal approximate runs in a string - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2017

Locating maximal approximate runs in a string

Résumé

An exact run in a string T is a non-empty substring of T that is a repetition of a smaller substring. Finding maximal exact runs in strings is an important problem and therefore a well-studied one in the area of stringology. For a given string T of length n, finding all maximal exact runs in the string can be done in O(n log n) time on general ordered alphabets or O(n) time on integer alphabets. In this paper, we investigate the maximal approximate runs problem: for a given string T and a number k, find non-empty substrings T of T such that changing at most k letters in T transforms them into a maximal exact run. We present an O(nk 2 log 2 k + occ) algorithm to solve this problem, where occ is the number of substrings found.
Fichier principal
Vignette du fichier
201705-approx_runs.pdf (567.65 Ko) Télécharger le fichier
Origine : Publication financée par une institution
Loading...

Dates et versions

hal-01771696 , version 1 (19-04-2018)

Identifiants

Citer

Mika Amit, Maxime Crochemore, Gad Landau, Dina Sokol. Locating maximal approximate runs in a string. Theoretical Computer Science, 2017, 700, pp.45-62. ⟨10.1016/j.tcs.2017.07.021⟩. ⟨hal-01771696⟩
96 Consultations
111 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More