21 search results - page 1 / 5 » On-Line Linear-Time Construction of Word Suffix Trees |
CPM
2006
Springer
13 years 8 months ago
2006
Springer
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 ...
SODA
1990
ACM
13 years 6 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
STOC
2000
ACM
13 years 9 months ago
2000
ACM
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...
CPM
2001
Springer
13 years 9 months ago
2001
Springer
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
ALGORITHMICA
1999
13 years 4 months ago
1999
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...