Covering a String

Algorithmica (New York)

Volumn 16, Issue 3, 1996, Pages 288-297

  Iliopoulos, C S ^a,b   Moore, D W G ^b   Park, K ^c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b CURTIN UNIVERSITY   (Australia)

^c Seoul National University   (South Korea)

Author keywords

Combinatorial algorithms on words; Covering of strings; Partitioning; Periodicity of strings; String algorithms

Indexed keywords

EID: 1542711551     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01955677     Document Type: Article

References (11)

1. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. A. Apostolico and A. Ehrenfeucht, Efficient detection of quasiperiodicities in strings, Theoret. Comput. Sci. 119 (1993), 247-265.
3. A. Apostolico, M. Farach, and C. S. Iliopoulos, Optimal superprimitivity testing for strings, Inform. Process. Lett. 39 (1991), 17-20.
4. A. Apostolico and F. P. Preparata, Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci. 22 (1983), 297-315.
5. A. M. Ben-Amram, O. Berkman, C. S. Iliopoulos, and K. Park, The subtree max gap problem with application to parallel string covering, Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 501-510.
6. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen, and J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoret. Comput. Sci. 40 (1985), 31-55.
7. D. Breslauer, An on-line string superprimitivity test, Inform. Process. Lett. 44 (1992), 345-347.
8. M. Crochemore, An optimal algorithm for computing the repetitions in a word, Inform. Process. Lett. 12 (1981), 244-250.
9. M. Crochemore, Transducers and repetitions, Theoret. Comput. Sci. 45 (1986), 63-86.
10. J. E. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, in Kohavi and Paz, eds., Theory of Machines and Computations, Academic Press, New York, 1971, pp. 189-196.
11. D. E. Knuth, J. H. Morris and V. R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977), 323-350.