New simple efficient algorithms computing powers and runs in strings - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2014

New simple efficient algorithms computing powers and runs in strings

Résumé

Run in a string Square in a string Cube in a string Dictionary of Basic Factors a b s t r a c t Three new simple O(n log n) time algorithms related to repeating factors are presented in the paper. The first two algorithms employ only a basic textual data structure called the Dictionary of Basic Factors. Despite their simplicity these algorithms not only detect existence of powers (in particular, squares) in a string but also find all primitively rooted cubes (as well as higher powers) and all cubic runs. Our third O(n log n) time algorithm computes all runs and is probably the simplest known efficient algorithm for this problem. It uses additionally the Longest Common Extension function, however, due to relaxed running time constraints, a simple O(n log n) time implementation can be used. At the cost of logarithmic factor (in time complexity) we obtain novel algorithmic solutions for several classical string problems which are much simpler than (usually quite sophisticated) linear time algorithms.
Fichier principal
Vignette du fichier
simplesq_psc_proceedings.pdf (201.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01806287 , version 1 (08-06-2018)

Identifiants

Citer

Maxime Crochemore, C.S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, et al.. New simple efficient algorithms computing powers and runs in strings. Discrete Applied Mathematics, 2014, 163, pp.258-267. ⟨10.1016/j.dam.2013.05.009⟩. ⟨hal-01806287⟩

Collections

IRSTEA INRAE
30 Consultations
201 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More