Abstract

The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner [Wei73], who introduced the data structure, gave an O(n) time algorithm algorithm for building the suffix tree of an n character string drawn from a constant size alphabet. In the comparison model, there is a trivial\Omega\Gamma n log n) time lower bound based on sorting, and Weiner's algorithm matches this bound trivially. Since Weiner's paper, the main open question has been how to deal with integer alphabets. There is no super-linear lower bound, and the fastest known algorithm was the O(n log n) time comparison based algorithm. We settle this open problem by closing the gap: we build suffix trees in linear time for integer alphabet.

Citations

2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
493	A space-economical suffix tree construction algorithm - MCCREIGHT - 1976
380	pattern matching algorithms - Weiner, Linear - 1973
285	Fast algorithms for finding nearest common ancestors - Harel, Tarjan - 1984
30	Efficient and elegant subword tree construction - Chen, Seiferas - 1985
14	Optimal logarithmic time randomized suffix tree construction - Farach, Muthukrishnan - 1996
8	Large-scale assembly of dna strings and space-efficient construction of suffix trees (corrections - Kosaraju, Delcher - 1996
2	Real-time suffix tree construction - Kosaraju - 1994