773 search results - page 3 / 155 » Suffix Trees on Words |
ACSC
2002
IEEE
14 years 1 days ago
2002
IEEE
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments against widespread usage of the structure is its spac...
IDEAS
2008
IEEE
14 years 1 months ago
2008
IEEE
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
SODA
1990
ACM
13 years 8 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...
CPM
1999
Springer
13 years 11 months ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
DCC
2009
IEEE
14 years 7 months ago
2009
IEEE
