Finding maximal quasiperiodicities in strings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1848, Issue , 2000, Pages 397-411

  Brodal, Gerth Stølting ^a   Pedersen, Christian N S ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; PATTERN MATCHING;

MULTIPLE SEARCH; QUASI-PERIODIC; QUASI-PERIODICITIES; SEARCH TREES; SUB-STRINGS; SUBSTRING; SUFFIX-TREES;

TREES (MATHEMATICS);

ALGORITHMS; DATA;

EID: 84937411835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45123-4_33     Document Type: Conference Paper

References (28)

1. G. M. Adel’son-Vel’skii and Y. M. Landis. An algorithm for the organization of information. Doklady Akademii Nauk SSSR, 146:263-266, 1962. English translation in Soviet Math. Dokl., 3:1259-1262
2. A. V. Aho, J. E. Hopcraft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974
3. A. Apostolico and D. Breslauer. Of periods, quasiperiods, repetitions and covers. In A selection of essays in honor of A. Ehrenfeucht, volume 1261 of Lecture Notes in Computer Science. Springer, 1997
4. A. Apostolico and A. Ehrenfeucht. Efficient detection of quasiperiodicities in strings. Theoretical Computer Science, 119:247-265, 1993
5. A. Apostolico, M. Farach, and C. S. Iliopoulos. Optimal superprimitivity testing for strings. Information Processing Letters, 39:17-20, 1991
6. A. Apostolico and F. P. Preparata. Optimal off-line detection of repetitions in a string. Theoretical Computer Science, 22:297-315, 1983
7. D. Breslauer. An on-line string superprimitivity test. Information Processing Letters, 44:345-347, 1992
8. G. S. Brodal, R. B. Lyngsø, C. N. S. Pedersen, and J. Stoye. Finding maximal pairs with bounded gap. In Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 1645 of Lecture Notes in Computer Science, pages 134-149, 1999
9. G. S. Brodal and C. N. S. Pedersen. Finding maximal quasiperiodicities in strings. Technical Report RS-99-25, BRICS, September 1999
10. M. R. Brown and R. E. Tarjan. A fast merging algorithm. Journal of the ACM, 26(2):211-226, 1979
11. M. Crochemore. An optimal algorithm for computing the repetitions in a word. Information Processing Letters, 12(5):244-250, 1981
12. M. Crochemore. Transducers and repetitions. Theoretical Computer Science, 45:63-86, 1986
13. D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997
14. D. Gusfield and J. Stoye. Linear time algorithms for finding and representing all the tandem repeats in a string. Technical Report CSE-98-4, Department of Computer Science, UC Davis, 1998
15. C. S. Iliopoulos and L. Mouchard. Quasiperiodicity: From detection to normal forms. Journal of Automata, Languages and Combinatorics, 4(3):213-228, 1999
16. R. Kolpakov and G. Kucherov. Maximal repetitions in words or how to find all squares in linear time. Technical Report 98-R-227, LORIA, 1998
17. M. G. Main and R. J. Lorentz. An O(n log n) algorithm for finding all repetitions in a string. Journal of Algorithms, 5:422-432, 1984
18. M. G. Main and R. J. Lorentz. Linear time recognition of squarefree strings. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume F12 of NATO ASI Series, pages 271-278. Springer, Berlin, 1985
19. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262-272, 1976
20. K. Mehlhorn. Sorting and Searching, volume 1 of Data Structures and Algorithms. Springer-Verlag, 1994
21. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999
22. D. Moore and W. F. Smyth. Computing the covers of a string in linear time. In Proceedings of the 5th Annual Symposium on Discrete Algorithms (SODA), pages 511-515, 1994
23. M. Rabin. Discovering repetitions in strings. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume F12 of NATO ASI Series, pages 279-288. Springer, Berlin, 1985
24. J. Stoye and D. Gusfield. Simple and flexible detection of contiguous repeats using a suffix tree. In Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 1448 of Lecture Notes in Computer Science, pages 140-152, 1998
25. A. Thue. ¨Uber unendliche Zeichenreihen. Skrifter udgivet af Videnskabsselskabet i Christiania, Mathematisk-og Naturvidenskabeligklasse, 7:1-22, 1906
26. A. Thue. Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Skrifter udgivet af Videnskabsselskabet i Christiania, Mathematisk-og Naturvidenskabeligklasse, 1:1-67, 1912
27. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995
28. P. Weiner. Linear pattern matching algorithms. In Proceedings of the 14th Symposium on Switching and Automata Theory, pages 1-11, 1973