A new periodicity lemma

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 257-265

  Fan, Kangmin ^a   Smyth, William F ^a,b   Simpson, R J ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b CURTIN UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBLEM SOLVING; THEOREM PROVING;

CONSTANT OF PROPORTIONALITY; LEMMA; PERIODICITY; SUBSTRING;

PATTERN MATCHING;

EID: 26444601218     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_22     Document Type: Conference Paper

References (16)

1. Alberto Apostolico & Franco P. Preparata, Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci. 22 (1983) 297-315.
2. Maxime Crochemore, An optimal algorithm for computing the repetitions in a word, Inform. Process. Lett. 12-5 (1981) 244-250.
3. th IEEE Symp. Found. Computer Science (1997) 137-143.
4. N. J. Fine & Herbert S. Wilf, Uniqueness theorems for periodic functions, Proc. Amer. Math. Soc. 16 (1965) 109-114.
5. th Australasian Workshop on Combinatorial Algorithms, Mirka Miller & Kunsoo Park (eds.) (2003) 26-35.
6. th Internat. Colloq. Automata, Languages & Programming (2003) 943-955.
7. Pang Ko & Srinivas Aluru, Space efficient linear time construction of suffix arrays, Proc. 14 Annual Symp. Combinatorial Pattern Matching, R. Baeza-Yates, E. Chávez & M. Crochemore (eds.), LNCS 2676, Springer-Verlag (2003) 200-210.
8. Roman Kolpakov & Gregory Kucherov, On maximal repetitions in words, J. Discrete Algs. 1 (2000) 159-186.
9. Abraham Lempel & Jacob Ziv, On the complexity of finite sequences, IEEE Trans. Information Theory 22 (1976) 75-81.
10. M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press (2002) 504 pp.
11. Michael G. Main, Detecting leftmost maximal periodicities, Discrete Applied Maths. 25 (1989) 145-153.
12. Michael G. Main & Richard J. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, J. Algs. 5 (1984) 422-432.
13. Edward M. McCreight, A space-economical suffix tree construction algorithm, J. Assoc. Comput. Mach. 32-2 (1976) 262-272.
14. Bill Smyth, Computing Patterns in Strings, Pearson Addison-Wesley (2003) 423 pp.
15. Axel Thue, Über unendliche zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana 7 (1906) 1-22.
16. Peter Weiner, Linear pattern matching algorithms, Proc. 14th Annual IEEE Symp. Switching & Automata Theory (1973) 1-11.