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 publicationProceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000
Pages407-415
Number of pages9
DOIs
StatePublished - 2000
Event32nd Annual ACM Symposium on Theory of Computing, STOC 2000 - Portland, OR, United States
Duration: May 21 2000May 23 2000

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference32nd Annual ACM Symposium on Theory of Computing, STOC 2000
CountryUnited States
CityPortland, OR
Period5/21/005/23/00

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Faster suffix tree construction with missing suffix links'. Together they form a unique fingerprint.

Cite this