TY - GEN

T1 - Faster suffix tree construction with missing suffix links

AU - Cole, Richard

AU - Hariharan, Ramesh

N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.

PY - 2000

Y1 - 2000

N2 - We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix 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 suffix trees for general situations with missing suffix links in O(n) time, with high probability. This gives the first randomized linear time algorithm for constructing suffix trees for parameterized strings.

AB - We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix 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 suffix trees for general situations with missing suffix links in O(n) time, with high probability. This gives the first randomized linear time algorithm for constructing suffix trees for parameterized strings.

UR - http://www.scopus.com/inward/record.url?scp=0033690736&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033690736&partnerID=8YFLogxK

U2 - 10.1145/335305.335352

DO - 10.1145/335305.335352

M3 - Conference contribution

AN - SCOPUS:0033690736

SN - 1581131844

SN - 9781581131840

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 407

EP - 415

BT - Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000

T2 - 32nd Annual ACM Symposium on Theory of Computing, STOC 2000

Y2 - 21 May 2000 through 23 May 2000

ER -