Faster suffix tree construction with missing suffix links

Richard Cole, Ramesh Hariharan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the Annual ACM Symposium on Theory of Computing
Pages407-415
Number of pages9
StatePublished - 2000
Event32nd Annual ACM Symposium on Theory of Computing - Portland, OR, USA
Duration: May 21 2000May 23 2000

Other

Other32nd Annual ACM Symposium on Theory of Computing
CityPortland, OR, USA
Period5/21/005/23/00

Fingerprint

Backpropagation

ASJC Scopus subject areas

  • Software

Cite this

Cole, R., & Hariharan, R. (2000). Faster suffix tree construction with missing suffix links. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 407-415)

Faster suffix tree construction with missing suffix links. / Cole, Richard; Hariharan, Ramesh.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2000. p. 407-415.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cole, R & Hariharan, R 2000, Faster suffix tree construction with missing suffix links. in Conference Proceedings of the Annual ACM Symposium on Theory of Computing. pp. 407-415, 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, USA, 5/21/00.
Cole R, Hariharan R. Faster suffix tree construction with missing suffix links. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2000. p. 407-415
Cole, Richard ; Hariharan, Ramesh. / Faster suffix tree construction with missing suffix links. Conference Proceedings of the Annual ACM Symposium on Theory of Computing. 2000. pp. 407-415
@inproceedings{5d40d8256bc04c2f815f4cccf244db56,
title = "Faster suffix tree construction with missing suffix links",
abstract = "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.",
author = "Richard Cole and Ramesh Hariharan",
year = "2000",
language = "English (US)",
pages = "407--415",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

}

TY - GEN

T1 - Faster suffix tree construction with missing suffix links

AU - Cole, Richard

AU - Hariharan, Ramesh

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

M3 - Conference contribution

SP - 407

EP - 415

BT - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

ER -