A locally adaptive data compression scheme
Communications of the ACM
Design and analysis of dynamic Huffman codes
Journal of the ACM (JACM)
Data compression using dynamic Markov modelling
The Computer Journal
Analysis of arithmetic coding for data compression
Information Processing and Management: an International Journal - Special issue on data compression for images and texts
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Arithmetic coding for data compression
Communications of the ACM
Efficient implementation of suffix trees
Software—Practice & Experience
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Data compression: the complete reference
Data compression: the complete reference
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An analysis of the Burrows-Wheeler transform
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Efficient Algorithms foe On-Line Symbol Ranking Compression
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Symbol Ranking Text Compressors
DCC '97 Proceedings of the Conference on Data Compression
A Fast Block-Sorting Algorithm for Lossless Data Compression
DCC '97 Proceedings of the Conference on Data Compression
Universal Lossless Source Coding with the Burrows Wheeler Transform
DCC '99 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
DCC '99 Proceedings of the Conference on Data Compression
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Compression of Low Entropy Strings with Lempel-Ziv Algorithms
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
The Context Trees of Block Sorting Compression
DCC '98 Proceedings of the Conference on Data Compression
On Optimality of Varients of the Block Sorting Compression
DCC '98 Proceedings of the Conference on Data Compression
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Computing Inverse ST in Linear Complexity
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Bidirectional search in a string with wavelet trees
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Computing the inverse sort transform in linear time
ACM Transactions on Algorithms (TALG)
Balancing and clustering of words in the Burrows-Wheeler transform
Theoretical Computer Science
A new combinatorial approach to sequence comparison
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
In this paper we describe the Burrows-Wheeler Transform (BWT) a completely new approach to data compression which is the basis of some of the best compressors available today. Although it is easy to intuitively understand why the BWT helps compression, the analysis of BWT-based algorithms requires a careful study of every single algorithmic component. We describe two algorithms which use the BWT and we show that their compression ratio can be bounded in terms of the k-th order empirical entropy of the input string for any k ≥ 0. Intuitively, this means that these algorithms are able to make use of all the regularity which is in the input string. We also discuss some of the algorithmic issues which arise in the computation of the BWT, and we describe two variants of the BWT which promise interesting developments.