Optimal off-line detection of repetitions in a string

Theoretical Computer Science

Volumn 22, Issue 3, 1983, Pages 297-315

  Apostolico, A ^a   Preparata, F P ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 49049125709     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(83)90109-3     Document Type: Article

References (17)

1. Fast applications of suffix trees
2. Solution to Problem 5030
3. An optimal algorithm for computing the repetitions in a word
4. Sur la périodicité des mots
5. Uniqueness theorems for periodic functions
6. Remarks on the work of Axel Thue on sequences
7. Fast pattern matching in strings
8. A combinatorial problem in the theory of free monoids
9. P in a free group
10. An O(n log n) algorithm for finding repetition in a string
11. A space economical suffix tree construction algorithm
12. Comparative schematology
13. Über die gegenseitige Lage gleicher Teile Gewisser Zeichenreichen
14. Linear pattern matching algorithms