, Volume 14, Issue 3, pp 249–260

On-line construction of suffix trees

  • E. Ukkonen


An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It always has the suffix tree for the scanned part of the string ready. The method is developed as a linear-time version of a very simple algorithm for (quadratic size) suffixtries. Regardless of its quadratic worst case this latter algorithm can be a good practical method when the string is not too long. Another variation of this method is shown to give, in a natural way, the well-known algorithms for constructing suffix automata (DAWGs).

Key words

Linear-time algorithm Suffix tree Suffix trie Suffix automaton DAWG 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc 1995

Authors and Affiliations

  • E. Ukkonen
    • 1
  1. 1.Department of Computer ScienceUniversity of HelsinkiTeollisuuskatu 23

Personalised recommendations