10 search results - page 1 / 2 » Constructing Word-Based Text Compression Algorithms |
DCC
1992
IEEE
13 years 9 months ago
1992
IEEE
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...
DLT
2004
13 years 6 months ago
2004
There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
CONIELECOMP
2005
IEEE
13 years 10 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
JEA
2008
13 years 4 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...
EDBT
2010
ACM
13 years 8 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...