4 search results - page 1 / 1 » On Entropy-Compressed Text Indexing in External Memory |
SPIRE
2009
Springer
13 years 11 months ago
2009
Springer
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
16
Voted
JEA
2008
13 years 5 months ago
2008
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
CPM
2010
Springer
13 years 9 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...