Skip to main content
SpringerLink
Log in

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

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Technische Fakultät, Universität Bielefeld, Postfach 100 131, D-33501 Bielefeld, Germany. robert@techfak.uni-bielefeld.de, kurtz@techfak.uni-bielefeld.de., , , , , , DE

    R. Giegerich & S. Kurtz

Authors
  1. R. Giegerich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Kurtz
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received February 12, 1995; revised January 28, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Giegerich, R., Kurtz, S. From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction . Algorithmica 19, 331–353 (1997). https://doi.org/10.1007/PL00009177

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009177

Search

Navigation