Jump to content

Ukkonen algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 62.214.205.208 (talk) at 14:56, 27 February 2006 (→External link). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Ukkonen algorithm of creation of suffix trees creates the tree for a given string in time linear in the length of the string. The algorithm has the property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the string ready. It was first described by Esko Ukkonen.

  • [1] The original publication of the algorithm
  • [2] Original publication with figures included
Retrieved from "https://en.wikipedia.org/w/index.php?title=Ukkonen_algorithm&oldid=41464757"