Linear-Time Computation of Local Periods

Jean-Pierre Duval 1 Roman Kolpakov Gregory Kucherov 2 Thierry Lecroq 1 Arnaud Lefebvre 1
1 UNIROUEN - Université de Rouen Normandie
2 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present a linear-time algorithm for computing {\em all} local periods of a given word. This subsumes (but is substantially more powerful than) the computation of the (global) period of the word and on the other hand, the computation of a critical factorization, implied by the Critical Factorization Theorem.
Mots-clés : mot complexity word local period algorithm période locale algorithme complexité
Type de document :
Communication dans un congrès
Branislav Rovan and Peter Vojtas. 28nd International Symposium on Mathematical Foundations of Computer Science - MFCS'03, Aug 2003, Bratislava, Slovakia, Springer Verlag, 2747, pp.388-397, 2003, Lecture Notes in Computer Science
Liste complète des métadonnées
https://hal.inria.fr/inria-00099598
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 09:39:07
Dernière modification le : mardi 5 juin 2018 - 10:14:39

Identifiants

  • HAL Id : inria-00099598, version 1

Collections

INRIA | COMUE-NORMANDIE | LORIA | UNIV-LORRAINE

Citation

Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre. Linear-Time Computation of Local Periods. Branislav Rovan and Peter Vojtas. 28nd International Symposium on Mathematical Foundations of Computer Science - MFCS'03, Aug 2003, Bratislava, Slovakia, Springer Verlag, 2747, pp.388-397, 2003, Lecture Notes in Computer Science. 〈inria-00099598〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

291

Contact


archive-ouverte@inria.fr