Sciweavers

IR
2008
13 years 4 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
CPM
2006
Springer
108views Combinatorics» more  CPM 2006»
13 years 8 months ago
Reducing the Space Requirement of LZ-Index
The LZ-index is a compressed full-text self-index able to represent a
Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakan...
SPIRE
2007
Springer
13 years 10 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...