Algorithmica

, Volume 19, Issue 3, pp 331–353

From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction

Authors

  • R. Giegerich
    • Technische Fakultät, Universität Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de.
  • S. Kurtz
    • Technische Fakultät, Universität Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de.

DOI: 10.1007/PL00009177

Cite this article as:
Giegerich, R. & Kurtz, S. Algorithmica (1997) 19: 331. doi:10.1007/PL00009177

Abstract.

We review the linear-time suffix tree constructions by Weiner, McCreight, and Ukkonen. We use the terminology of the most recent algorithm, Ukkonen's on-line construction, to explain its historic predecessors. This reveals relationships much closer than one would expect, since the three algorithms are based on rather different intuitive ideas. Moreover, it completely explains the differences between these algorithms in terms of simplicity, efficiency, and implementation complexity.

Key words. Text processing, On-line string matching, Suffix trees, Linear-time algorithm, Program transformation.
Download to read the full article text

Copyright information

© 1997 Springer-Verlag New York Inc.