When indexing equals compression: Experiments with compressing suffix arrays and applications
ACM Transactions on Algorithms (TALG)
The engineering of a compression boosting library: theory vs practice in BWT compression
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Burrows–Wheeler compression: Principles and reflections
Theoretical Computer Science
The myriad virtues of Wavelet Trees
Information and Computation
Note: On compact representations of All-Pairs-Shortest-Path-Distance matrices
Theoretical Computer Science
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
The myriad virtues of wavelet trees
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Move-to-front, distance coding, and inversion frequencies revisited
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
We report on a simple encoding format called wzip for decompressing block-sorting transforms, such as the Burrows-Wheeler Transform (BWT). Our compressor uses the simple notions of gamma encoding and RLE, organized witha wavelet tree, to achieve a slightly better compression ratio than bzip2 inless time. In fact, our compression/decompression time is dependent on Hh,the hth order empirical entropy. This relationship of performance to the compressibility of data is a key new idea among compression algorithms. Anotherkey contribution of our compressor is its simplicity. Our compressor can alsooperate as a full-text index with a small amount of data, while still preservingbackward compatibility with just the compressor.