DMCA
On-Line Construction of Suffix Trees (1995)
Cached
Download Links
| Citations: | 436 - 2 self |
BibTeX
@MISC{Ukkonen95on-lineconstruction,
author = {Esko Ukkonen},
title = {On-Line Construction of Suffix Trees},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 has always 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) suffix tries. 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).
Keyphrases
suffix tree on-line construction new algorithm string symbol scanned part simple algorithm well-known algorithm on-line algorithm suffix automaton suffix try linear-time version good practical method desirable property latter algorithm quadratic worst-case time linear natural way quadratic size
