On-Line Linear-Time Construction of Word Suffix Trees

Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees are kind of suffix trees that represent only a subset of suffixes of the input string. In this paper we study word suffix trees, which are one variation of sparse suffix trees. Let D be a dictionary of words and w be a string in D+ , namely, w is a sequence w1

• Type: Conference
• Year: 2006
• Where: CPM
• Authors: Shunsuke Inenaga, Masayuki Takeda
• Keywords: Combinatorics, CPM 2006, Sparse Suffix Trees, Suffix Tree, Word Suffix Tree