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).

Citations

493	A space-economical suffix tree construction algorithm - MCCREIGHT - 1976
449	M.J.: Efficient string matching: An aid to bibliographic search - Aho, Corasick - 1975
380	pattern matching algorithms - Weiner, Linear - 1973
110	The myriad virtues of subword trees - Apostolico - 1985
88	The smallest automaton recognizing the subwords of a text - Blumer, Blumer, et al. - 1985
54	Data structures and algorithms for approximate string matching - Galil, Giancarlo - 1988
53	Approximate string-matching over suffix trees - Ukkonen - 1993
47	Constructing suffix trees on-line in linear time - Ukkonen - 1992
22	Adaptive dictionary matching - Amir, Farach - 1991
18	Approximate string matching with suffix automata - Ukkonen, Wood - 1993
8	String matching with constraints - Crochemore - 1988
5	Time optimal left to right construction of position trees - Kempf, Bayer, et al. - 1987