Data compression using dynamic Markov modelling
The Computer Journal
Text compression
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Arithmetic coding for data compression
Communications of the ACM
A comparison of imperative and purely functional suffix tree constructions
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Reducing the space requirement of suffix trees
Software—Practice & Experience
Direct Construction of Compact Directed Acyclic Word Graphs
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
A Corpus for the Evaluation of Lossless Compression Algorithms
DCC '97 Proceedings of the Conference on Data Compression
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Unbounded length contexts for PPM
DCC '95 Proceedings of the Conference on Data Compression
A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation
DCC '98 Proceedings of the Conference on Data Compression
The Context Trees of Block Sorting Compression
DCC '98 Proceedings of the Conference on Data Compression
Universal coding of integers and unbounded search trees
IEEE Transactions on Information Theory
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
A Method for Compressing Test Data Based on Burrows-Wheeler Transformation
IEEE Transactions on Computers
Antisequential Suffix Sorting for BWT-Based Data Compression
IEEE Transactions on Computers
Context exhumation after the Burrows-Wheeler transform
Information Processing Letters
Efficient Algorithms for the Inverse Sort Transform
IEEE Transactions on Computers
Burrows–Wheeler compression: Principles and reflections
Theoretical Computer Science
Compressing table data with column dependency
Theoretical Computer Science
Parallel lossless data compression using the Burrows-Wheeler Transform
International Journal of Web and Grid Services
Computing Inverse ST in Linear Complexity
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
An Application of Self-organizing Data Structures to Compression
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Context exhumation after the Burrows--Wheeler transform
Information Processing Letters
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
Computing the inverse sort transform in linear time
ACM Transactions on Algorithms (TALG)
Space efficient algorithms for the burrows-wheeler backtransformation
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Revisiting bounded context block-sorting transformations
Software—Practice & Experience
| Hi-index | 14.99 |
A very interesting recent development in data compression is the Burrows-Wheeler Transformation [1]. The idea is to permute the input sequence in such a way that characters with a similar context are grouped together. We provide a thorough analysis of the Burrows-Wheeler Transformation from an information theoretic point of view. Based on this analysis, the main part of the paper systematically considers techniques to efficiently implement a practical data compression program based on the transformation. We show that our program achieves a better compression rate than other programs that have similar requirements in space and time.