223 search results - page 1 / 45 » Suffix Arrays on Words |
CPM
2007
Springer
13 years 9 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
CPM
2007
Springer
13 years 9 months ago
2007
Springer
STRINGOLOGY
2008
13 years 7 months ago
2008
CPM
1999
Springer
13 years 9 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...
CPM
2006
Springer
13 years 9 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 ...