A new periodicity Lemma

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 3, 2006, Pages 656-668

  Fan, Kangmin ^a   Puglisi, Simon J ^b   Smyth, W F ^a,b   Turpin, Andrew ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b CURTIN UNIVERSITY   (Australia)

^c RMIT UNIVERSITY   (Australia)

Author keywords

Maximal periodicity; Periodicity; Repetition; Run; Square; String; Word

Indexed keywords

ALGORITHMS; FINITE DIFFERENCE METHOD; INTEGER PROGRAMMING; NUMBER THEORY;

MAXIMAL PERIODICITY; PERIODICITY; PROPORTIONALITY;

TIME VARYING SYSTEMS;

EID: 34547877620     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/050630180     Document Type: Article

References (24)

1. A. APOSTOLICO AND F. P. PREPARATA, Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci., 22 (1983), pp. 297-315.
2. M. CROCHEMORE, An optimal algorithm, for computing the repetitions in a word, Inform. Process. Lett., 12 (1981), pp. 244-250.
3. M. CROCHEMORE AND W. RYTTER, Squares, cubes, and time-space efficient strings searching, Algorithmica, 13 (1995), pp. 405-425.
4. M. FARACH, Optimal suffix tree construction with large alphabets, in Proceedings of the 38th Annual IEEE Symposium on Foundation of Computer Science, 1997, pp. 137-143.
5. N. J. FINE AND H. S. WILF, Uniqueness theorems for periodic functions, Proc. Amer. Math. Soc., 16 (1965), pp. 109-114.
6. A. S. FRAENKEL AND R. J. SIMPSON, HOW many sqares can a string contain?, J. Combin. Theory Ser. A, 82 (1998), pp. 112-120.
7. F. FRANEK, R. J. SIMPSON, AND W. F. SMYTH, The maximum number of runs in a string, M. Miller and K. Park, eds., in Proceedings of the 14th Annual Australasian Workshop on Combinatorial Algorithms, 2003, pp. 26-35.
8. L. ILIE, A simple proof that a word of length n has at most 2n distinct squares, J. Combin. Theory Ser. A, 112 (2005), pp. 163-164.
9. L. ILIE, A note on the number of distinct squares in a word, in Proceedings of the 5th Annual International Conference on Combinatorics on Words, S. Brlek and C. Reutenauer, eds., 2005, pp. 289-294.
10. J. KÄRKKÄINEN AND P. SANDERS, Simple linear work suffix array construction, in Proceedings of the 30th Annual International Conference on Automata, Languages, and Programming, 2003, pp. 943-955.
11. D. K. KIM, J. S. SIM, H. PARK, AND K. PARK, Linear-time construction of suffix, arrays, in Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 2676, R. Baeza-Yates, E. Chávez, and M. Crochemore, eds., Springer-Verlag, Berlin, 2003, pp. 186-199.
12. P. KO AND S. ALURU, Space efficient linear time construction of suffix arrays, in Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 2676, R. Baeza-Yates, E. Chávez, and M. Crochemore, (ids., Springer-Verlag, Berlin, 2003, pp. 200-210.
13. R. KOLPAKOV AND G. KUCHEROV, On maximal repetitions in words, J. Discrete Algorithms, 1 (2000), pp. 159-186.
14. A. LEMPEL AND J. ZIV, On the complexity of finite sequences, IEEE Trans. Inform. Theory, 22 (1976), pp. 75-81.
15. M. LOTHAIRE, Algebraic Combinatorics on Words, Cambridge University Press, Cambridge, UK, 2002.
16. M. G. MAIN, Detecting leftmost maximal periodicities, Discrete Appl. Math., 25 (1989), pp. 145-153.
17. M. G. MAIN AND R. J. LORENTZ, An O(n log n) algorithm for finding all repetitions in a string, J. Algorithms, 5 (1984), pp. 422-432.
18. E. M. MCCREIGHT, A space-economical suffix tree construction algorithm, J. ACM, 23 (1976), pp. 262-272.
19. S. J. PUGLISI, W. F. SMYTH, AND A. TURHIN, The performance of linear time suffix sorting algorithms, in Proceedings of the IEEE Data Compression Conference, J. Storor and M. Cohn, eds., 2005, pp. 358-367.
20. S. J. PUGLISI, W. F. SMYTH, AND A. TURPIN, A taxonomy of suffix array construction algorithms, ACM Comput. Surv., to appear.
21. W. RYTTER, The number of runs in a string: Improved analysis of the linear upper bound, in Proceedings of the 23rd Symposium on Theoretical Aspects of Computer Science, B. Durand and W. Thomas, eds., Lecture Notes in Comput. Sci. 2884, Springer-Verlag, Berlin, 2006, pp. 184-195.
22. B. SMYTH, Computing Patterns in Strings, Addison-Wesley, Reading, MA, 2003.
23. A. THUE, Über unendliche zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana, 7 (1906), pp. 1-22.
24. P. WEINER, Linear pattern matching algorithms, in Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11.