A locally adaptive data compression scheme
Communications of the ACM
Elements of information theory
Elements of information theory
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
Burrows--Wheeler compression with variable length integer codes
Software—Practice & Experience
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
DCC '97 Proceedings of the Conference on Data Compression
Modifications of the Burrows and Wheeler Data Compression Algorithm
DCC '99 Proceedings of the Conference on Data Compression
Boosting textual compression in optimal linear time
Journal of the ACM (JACM)
Succinct suffix arrays based on run-length encoding
Nordic Journal of Computing
When indexing equals compression: Experiments with compressing suffix arrays and applications
ACM Transactions on Algorithms (TALG)
ACM Computing Surveys (CSUR)
Incremental frequency count—a post BWT-stage for the Burrows–Wheeler compression algorithm
Software—Practice & Experience
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
A simpler analysis of Burrows–Wheeler-based compression
Theoretical Computer Science
The myriad virtues of Wavelet Trees
Information and Computation
Implicit compression boosting with applications to self-indexing
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Universal lossless source coding with the Burrows Wheeler transform
IEEE Transactions on Information Theory
Most burrows-wheeler based compressors are not optimal
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 5.23 |
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we provide the first complete comparative analyses of these techniques, establishing upper and lower bounds on their compression ratios. We describe simple variants of these three techniques that compress any string up to a constant factor of its kth-order empirical entropy for any k=0. At the same time we prove lower bounds for the compression of arbitrary strings which show these variants to be nearly optimal. The bounds we establish are ''entropy-only'' bounds in the sense that they do not involve non-constant overheads. Our analyses provide new insights into the inner workings of these techniques, partially explain their good behavior in practice, and suggest strategies for improving their performance.