Linear-time computation of local periods

We present a linear-time algorithm for computing 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 The...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 326; no. 1; pp. 229 - 240
Main Authors Duval, Jean-Pierre, Kolpakov, Roman, Kucherov, Gregory, Lecroq, Thierry, Lefebvre, Arnaud
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 20.10.2004
Elsevier
Subjects
Algorithm
Algorithmics. Computability. Computer arithmetics
Applied sciences
Complexity
Computer Science
Computer science; control theory; systems
Data processing. List processing. Character string processing
Exact sciences and technology
Local period
Memory organisation. Data processing
Other
Period
Software
String matching
Theoretical computing
Word
Period
Word
Local period
Algorithm
String matching
Complexity
Computation time
Computer theory
Algorithm complexity
Linear time
Computing
Factorization
complexity
complexité
period
mot
période locale
algorithme
période
string matching
word
algorithm
local period
recherche de motifs
Online AccessGet full text

Cover

More Information
Summary:We present a linear-time algorithm for computing 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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2004.06.024