From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction

Algorithmica (New York)

Volumn 19, Issue 3, 1997, Pages 331-353

  Giegerich, R ^a   Kurtz, S ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Linear time algorithm; On line string matching; Program transformation; Suffix trees; Text processing

Indexed keywords

EID: 0001553729     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009177     Document Type: Article

References (26)

1. A. Aho. Algorithms for Finding Patterns in Strings. In van Leeuwen, J., editor, Handbook of Theoretical Computer Science, Volume A, pages 257-300. Elsevier, Amsterdam, 1990.
2. A. Aho and M. Corasick. Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM, 18:333-340, 1975.
3. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addision-Wesley, Reading, MA, 1982.
4. A. Apostolico. The Myriad Virtues of Subword Trees. In [5], pages 85-96, 1985.
5. A. Apostolico and Z. Galil. Combinatorial Algorithms on Words. Springer-Verlag, New York, 1985.
6. A. Apostolico and W. Szpankowski. Self-Alignments in Words and Their Applications. Journal of Algorithms, 13:446-467, 1992.
7. R.A. Baeza-Yates. String Searching Algorithms. In W. Frakes and R.A. Baeza-Yates, editors, Information Retrieval: Algorithms and Data Structures, pages 219-240. Prentice-Hall, Englewood Cliffs, NJ, 1992.
8. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M.T. Chen, and J. Seiferas. The Smallest Automaton Recognizing the Subwords of a Text. Theoretical Computer Science, 40:31-55, 1985.
9. W.I. Chang and E.L. Lawler. Sublinear Approximate String Matching and Biological Applications. Algorithmica, 12(4/5):327-344, 1994.
10. M.T. Chen and J.I. Seiferas. Efficient and Elegant Subword Tree Construction. In [5], pages 97-107, 1985.
11. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
12. M. Crochemore. String Matching with Constraints. In Proceedings of the 1988 International Symposium on Mathematical Foundations of Computer Science, pages 44-58. Lecture Notes in Computer Science, Volume 324. Springer-Verlag, Berlin, 1988.
13. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, 1994.
14. R. Giegerich and S. Kurtz. Suffix Trees in the Functional Programming Paradigm. In Proceedings of the European Symposium on Programming (ESOP '94), pages 225-240. Lecture Notes in Computer Science, Volume 788. Springer-Verlag, Berlin, 1994.
15. R. Giegerich and S. Kurtz. A Comparison of Imperative and Purely Functional Suffix Tree Constructions. Science of Computer Programming, 25(2-3):187-218, 1995.
16. G.H. Gonnet and R.A. Baeza-Yates. Handbook of Algorithms and Data Structures in Pascal and C. Addison-Wesley, Reading, MA, 1991.
17. S. Kurtz. Fundamental Algorithms for a Declarative Pattern Matching System. Dissertation, Technische Fakultät, Universität Bielefeld, available as Report 95-03, July 1995.
18. E.M. McCreight. A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262-272, 1976.
19. V.R. Pratt. Improvements and Applications of the Weiner Repetition Finder. Unpublished manuscript, Cambridge, MA, 1973.
20. S.C. Sahinalp and U. Vishkin. Symmetry Breaking for Suffix Tree Construction. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 300-309, 1994.
21. R. Sedgewick. Algorithms. Addision-Wesley, Reading, MA, 1988.
22. G. A. Stephen. String Searching Algorithms. World Scientific, Singapore, 1994.
23. J. Stoye. Affixbäume. Master's Thesis (in German), Technische Fakultät, Universität Bielefeld, 1995.
24. E. Ukkonen. Constructing Suffix Trees On-line in Linear Time. Algorithms, Software, Architecture. In van Leeuven, J., editor, Information Processing 92, Volume I, pages 484-492, Elsevier, Amsterdam, 1992.
25. E. Ukkonen. On-line Construction of Suffix-Trees (revised version of [24]). Algorithmica, 14:249-260, 1995.
26. P. Weiner. Linear Pattern Matching Algorithms. In Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.