A locally adaptive data compression scheme
Communications of the ACM
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
The Context Trees of Block Sorting Compression
DCC '98 Proceedings of the Conference on Data Compression
Can We Do without Ranks in Burrows Wheeler Transform Compression?
DCC '01 Proceedings of the Data Compression Conference
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
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
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
| Hi-index | 0.90 |
The essence of compression algorithms based on the Burrows-Wheeler transform is their first stage. In this stage, the information about the symbol contexts in the original sequence is lost and cannot be used in the rest of the algorithm. We show how to obtain some knowledge of the symbol contexts after the BWT. Using this information makes the prediction of symbol occurrence in further stages more accurate, which is confirmed by experiments.