Difference between revisions of "Ukkonen's algorithm"

Latest revision as of 18:54, 16 May 2016

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 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, going from the longest to the shortest suffix.

@@ Line 9: / Line 9: @@
 This order addition of characters gives Ukkonen's algorithm its "on-line" property.
-The original algorithm presented by Peter Weiner proceeded backward from the last character to the first one from the shortest to the longest suffix.
+The original algorithm presented by [[Peter Weiner]] 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]], going from the longest to the shortest suffix.