HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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é
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/inria-00099598
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 9:39:07 AM
Last modification on : Wednesday, February 23, 2022 - 3:37:12 AM

Identifiers

  • HAL Id : inria-00099598, version 1

Collections

INRIA | CNRS | COMUE-NORMANDIE | LORIA | UNIV-LORRAINE | UNIROUEN | INRIA2

Citation

Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre. Linear-Time Computation of Local Periods. 28nd International Symposium on Mathematical Foundations of Computer Science - MFCS'03, Aug 2003, Bratislava, Slovakia, pp.388-397. ⟨inria-00099598⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

166

 

Contact                    Legal Notice                    Personal Data