Download:
|
by Richard Cole, Ramesh Hariharan
In Proceedings of the Thirty Second Annual Symposium on the Theory of Computing
http://drona.csa.iisc.ernet.in/~ramesh/psfiles/25.ps.gz
Add To MetaCart
Abstract:
We consider sux tree construction for situations with missing sux links. Two examples of such situations are sux trees for parameterized strings and sux trees for 2D arrays. These trees also have the property that the node degrees may be large. We add a new back-propagation component to McCreight's algorithm and also give a high probability perfect hashing scheme to cope with large degrees. We show that these two features enable construction of sux trees for general situations with missing sux links in O(n) time, with high probability. This gives the rst randomized linear time algorithm for constructing sux trees for parameterized strings. 1.
Citations
|
623
|
Algorithms on Strings, Trees, and Sequences
– Gusfield
- 1997
|
|
489
|
A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
– Chernoff
- 1952
|
|
432
|
A Space-economical Suffix Tree Construction Algorithm
– McCreight
- 1976
|
|
321
|
Linear Pattern Matching Algorithms
– Weiner
- 1973
|
|
223
|
A data structure for dynamic trees
– Sleator, Tarjan
- 1983
|
|
209
|
Efficient Randomized Pattern-Matching Algorithms
– Karp, Rabin
- 1987
|
|
203
|
On-line construction of suffix trees
– Ukkonen
- 1995
|
|
192
|
Storing a sparse table with O(1) worst case access time
– Fredman, Koml'os, et al.
- 1984
|
|
120
|
Dynamic perfect hashing: upper and lower bounds
– Dietzfelbinger, Karlin, et al.
- 1994
|
|
103
|
Optimal suffix tree construction with large alphabets
– Farach
- 1997
|
|
65
|
A space-economical sux tree construction algorithm
– McCreight
- 1976
|
|
57
|
A theory of parameterized pattern matching: Algorithms and applications
– Baker
- 1993
|
|
54
|
Algorithms on strings, trees, and sequences
– Gus
- 1997
|
|
45
|
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
– SIEGEL
- 1989
|
|
35
|
auf der Heide. A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
– Dietzfelbinger, Meyer
- 1990
|
|
28
|
Optimal sux tree construction with large alphabets
– Farach
- 1997
|
|
14
|
auf der Heide. Dynamic hashing in real time
– Dietzfelbinger, Meyer
- 1992
|
|
11
|
A generalization of the suffix tree to square matrices, with applications
– Giancarlo
- 1995
|
|
7
|
Faster algorithms for the construction of parameterized suffix trees
– Kosaraju
- 1995
|
|
5
|
Constructing sux trees on-line in linear time
– Ukkonen
- 1992
|
|
3
|
Linear time construction of 2-D suffix trees
– Kim, Park
- 1999
|
|
2
|
A generalization of the sux tree to square matrices, with applications
– Giancarlo
- 1995
|
|
1
|
Characteristics of some animals calls. Nature 176:6–8 Marler P
– Kim, Park
- 1999
|
