A locally adaptive data compression scheme
Communications of the ACM
Interval and recency rank source coding: two on-line adaptive variable-length schemes
IEEE Transactions on Information Theory
ACM Computing Surveys (CSUR)
The data compression book (2nd ed.)
The data compression book (2nd ed.)
Journal of Experimental Algorithmics (JEA)
Reducing the space requirement of suffix trees
Software—Practice & Experience
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
Enhanced word-based block-sorting text compression
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
Burrows--Wheeler compression with variable length integer codes
Software—Practice & Experience
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Fast Block-Sorting Algorithm for Lossless Data Compression
DCC '97 Proceedings of the Conference on Data Compression
DCC '97 Proceedings of the Conference on Data Compression
A Corpus for the Evaluation of Lossless Compression 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
Improving Text Compression Ratios with the Burrows-Wheeler Transform
DCC '99 Proceedings of the Conference on Data Compression
DCC '00 Proceedings of the Conference on Data Compression
Move-to-Front and Inversion Coding
DCC '00 Proceedings of the Conference on Data Compression
On the Performance of BWT Sorting Algorithms
DCC '00 Proceedings of the Conference on Data Compression
An Efficient Method for in Memory Construction of Suffix Arrays
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Parsing Strategies for BWT Compression
DCC '01 Proceedings of the Data Compression Conference
Can We Do without Ranks in Burrows Wheeler Transform Compression?
DCC '01 Proceedings of the Data Compression Conference
LIPT: A Reversible Lossless Text Transform to Improve Compression Performance
DCC '01 Proceedings of the Data Compression Conference
Higher compression from the burrows-wheeler transform with new algorithms for the list update problem
Record Preprocessing for Data Compression
DCC '04 Proceedings of the Conference on Data Compression
Fast Compression with a Static Model in High-Order Entropy
DCC '04 Proceedings of the Conference on Data Compression
A Fast and Efficient Post BWT-Stage for the Burrows-Wheeler Compression Algorithm
DCC '05 Proceedings of the Data Compression Conference
Universal Text Preprocessing for Data Compression
IEEE Transactions on Computers
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
Burrows–Wheeler compression: Principles and reflections
Theoretical Computer Science
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
Context exhumation after the Burrows--Wheeler transform
Information Processing Letters
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
Grammar precompression speeds up burrows---wheeler compression
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
The lossless Burrows–Wheeler compression algorithm has received considerable attention over recent years for both its simplicity and effectiveness. It is based on a permutation of the input sequence—the Burrows–Wheeler transformation (BWT)—which groups symbols with a similar context close together. In the original version, this permutation was followed by a Move-To-Front transformation and a final entropy coding stage. Later versions used different algorithms, placed after the BWT, since the following stages have a significant influence on the compression rate. This paper describes different algorithms and improvements for these post BWT stages including a new context-based approach. The results for compression rates are presented together with compression and decompression times on the Calgary corpus, the Canterbury corpus, the large Canterbury corpus and the Lukas 2D 16-bit medical image corpus. Copyright © 2010 John Wiley & Sons, Ltd.