Everything About ___
Live briefing

Everything about Ukkonen's algorithm

Algorithm for construction of suffix trees

In computer science, Ukkonen's algorithm is a linear-time, online algorithm for constructing suffix trees, proposed by Esko Ukkonen in 1995. The algorithm begins with an implicit suffix tree containing the first character of the string. Then it steps through the string, adding successive characters until the tree is complete. This order addition of characters gives Ukkonen's algorithm its "on-line" property. The original algorithm presented by Peter Weiner in 1973 proceeded backward from the last character to the first one from the shortest to the longest suffix. A simpler algorithm was found by Edward M. McCreight in 1976, going from the longest to the shortest suffix. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Ukkonen's algorithmA 5-minute orientation
  2. Pick up a classic book: Algorithms and ApplicationsThe most-reprinted book on the subject
  3. Go sideways: Suffix treeA closely related topic
  4. Go sideways: LCP arrayA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Implicit suffix tree
  2. High level description of Ukkonen's algorithm
  3. Run time
  4. Ukkonen's algorithm example

🏆 Landmark papers (most cited)

đź“š Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics