Skip to Main content Skip to Navigation
Journal articles

Linear-Time Computation of Local Periods

Jean-Pierre Duval 1 Roman Kolpakov Gregory Kucherov 2 Thierry Lecroq 1 Arnaud Lefebvre 1
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.
Document type :
Journal articles
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 10:14:20 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM


  • HAL Id : inria-00100127, version 1


Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre. Linear-Time Computation of Local Periods. Theoretical Computer Science, Elsevier, 2004, 326 (1-3), pp.229-240. ⟨inria-00100127⟩



Record views