Sciweavers

229 search results - page 2 / 46
» Semi-Lossless Text Compression
Sort
View
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
13 years 10 months ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot
DATESO
2007
134views Database» more  DATESO 2007»
13 years 7 months ago
Genetic Algorithms in Syllable-Based Text Compression
Abstract. Syllable based text compression is a new approach to compression by symbols. In this concept syllables are used as the compression symbols instead of the more common char...
Tomas Kuthan, Jan Lansky
SPIRE
1998
Springer
13 years 9 months ago
Direct Pattern Matching on Compressed Text
We present a fast compression and decompression technique for natural language texts. The novelty is that the exact search can be done on the compressed text directly, using any k...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
DCC
1992
IEEE
13 years 9 months ago
Constructing Word-Based Text Compression Algorithms
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...
R. Nigel Horspool, Gordon V. Cormack
SODA
2004
ACM
131views Algorithms» more  SODA 2004»
13 years 7 months ago
When indexing equals compression: experiments with compressing suffix arrays and applications
We report on a new experimental analysis of high-order entropy-compressed suffix arrays, which retains the theoretical performance of previous work and represents an improvement in...
Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter