Self-adjusting binary search trees
Journal of the ACM (JACM)
A locally adaptive data compression scheme
Communications of the ACM
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Word-based block-sorting text compression
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Modifications of the Burrows and Wheeler Data Compression Algorithm
DCC '99 Proceedings of the Conference on Data Compression
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
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
Space-Time Tradeoffs in the Inverse B-W Transform
DCC '01 Proceedings of the Data Compression Conference
Universal Text Preprocessing for Data Compression
IEEE Transactions on Computers
Twol-amalgamated priority queues
Journal of Experimental Algorithmics (JEA)
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Revisiting dictionary-based compression: Research Articles
Software—Practice & Experience
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
Full-text search on multi-byte encoded documents
Proceedings of the 2012 ACM symposium on Document engineering
Hi-index | 0.00 |
The Block Sorting process of Burrows and Wheeler can be applied to any sequence in which symbols are (or might be) conditioned upon each other. In particular, it is possible to parse text into a stream of words, and then employ block sorting to identify and so exploit any conditioning relationships between words. In this paper we build upon the previous work of two of the authors, describing several further recency rank transformations, and considering also the role of the entropy coder. By combining the best of the new recency transformations with an entropy coder that conditions ranks upon gross characteristics of previous ones, we are able to obtain improved compression on typical text files.