Linear-time computation of local periods

Authors:
Jean-Pierre Duval;Roman Kolpakov;Gregory Kucherov;Thierry Lecroq;Arnaud Lefebvre
Affiliations:
LIFAR, Faculté des Sciences et Techniques, Université de Rouen, 76821 Mont-Saint-Aignan Cedex, France;Complexity Theory and Algorithmics Group, Department of Computer Science, The University of Liverpool, Chadwick Building, Peach Street, Liverpool L69 7ZF, UK;INRIA/LORIA, 615 rue du Jardin Botanique, B.P. 101, 54602 Villers-lès-Nancy, France;ABISS, Faculté des Sciences et Techniques, Université de Rouen, 76821 Mont-Saint-Aignan Cedex, France;UMR 6037/ABISS, Faculté des Sciences et Techniques, Université de Rouen, 76821 Mont-Saint-Aignan Cedex, France
Venue:
Theoretical Computer Science
Year:
2004

Citing 16
Cited 8

An O(n log n) algorithm for finding all repetitions in a string

Journal of Algorithms
Data compression: methods and theory

Data compression: methods and theory
Detecting leftmost maximal periodicities

Discrete Applied Mathematics - Combinatorics and complexity
Two-way string-matching

Journal of the ACM (JACM)
Text algorithms

Text algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Combinatorics of words

Handbook of formal languages, vol. 1
Local periods and propagation of periods in a word

Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
How many squares can a string contain?

Journal of Combinatorial Theory Series A
Linear Algorithm for Data Compression via String Matching

Journal of the ACM (JACM)
Recurrence and periodicity in infinite words from local periods

Theoretical Computer Science
A Periodicity Theorem on Words and Applications

MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Computation of Squares in a String (Preliminary Version)

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Finding Maximal Repetitions in a Word in Linear Time

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Finding Repeats with Fixed Gap

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Linear time algorithms for finding and representing all the tandem repeats in a string

Journal of Computer and System Sciences

Partial words and the critical factorization theorem revisited

Theoretical Computer Science
Computing Longest Previous Factor in linear time and applications

Information Processing Letters
A minimal periods algorithm with applications

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Extracting powers and periods in a string from its runs structure

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Simple real-time constant-space string matching

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
A comparison of index-based lempel-Ziv LZ77 factorization algorithms

ACM Computing Surveys (CSUR)
Simple real-time constant-space string matching

Theoretical Computer Science
Extracting powers and periods in a word from its runs structure

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.