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

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: complexity; mot; word; local period; algorithm; période locale; algorithme; complexité

Domaines: Autre [cs.OH]

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⟩