论文信息 - Optimal Suffix Tree Construction with Large Alphabets

Optimal Suffix Tree Construction with Large Alphabets

The su x tree of a string is the fundamental data structure of combinatorial pattern matching. In this paper, we present a novel, deterministic algorithm for the construction of su x trees. We settle the main open problem in the construction of su x trees: we build su x trees in linear time for integer alphabet.

Martin Farach-Colton | Martin Farach-Colton | Martín Farach-Colton

[1] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[2] J. Seiferas,et al. Efficient and Elegant Subword-Tree Construction , 1985 .

[3] Arthur L. Delcher,et al. Large-scale assembly of DNA strings and space-efficient construction of suffix trees , 1995, STOC '96.

[4] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..

[5] S. Muthukrishnan,et al. Optimal Logarithmic Time Randomized Suffix Tree Construction , 1996, ICALP.

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Xerox Polo,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976 .