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 two-dimensional arrays. These trees also have the property that the node degrees may be large. We add a new backpropagation component to McCreight’s algorithm and also give a high probability hashing scheme for 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. Key words. suffix tree, parameterized strings, two-dimensional suffix trees, dynamic perfect hashing AMS subject classifications. 68W05, 68W20, 68W40 DOI. 10.1137/S0097539701424465

• Type: Conference
• Year: 2000
• Where: STOC
• Authors: Richard Cole, Ramesh Hariharan
• Keywords: Algorithms, Parameterized Strings, STOC 2000, Suffix Trees, Two-dimensional Suffix Trees