A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
Modifications of the Burrows and Wheeler Data Compression Algorithm
DCC '99 Proceedings of the Conference on Data Compression
Opportunistic data structures with applications
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Generalization of the BWT Transformation and Inversion Ranks
DCC '02 Proceedings of the Data Compression Conference
Can We Do without Ranks in Burrows Wheeler Transform Compression?
DCC '01 Proceedings of the Data Compression Conference
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Theoretical Computer Science
Dynamic entropy-compressed sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
Implicit compression boosting with applications to self-indexing
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Space efficient algorithms for the burrows-wheeler backtransformation
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Fast relative lempel-ziv self-index for similar sequences
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
In this paper we provide the first compression booster that turns a zeroth order compressor into a more effiective k-th order compressor without any loss in time efficiency. More precisely, let A be an algorithm that compresses a string s within λ|s|H*0(s)+μ bits of storage in O(T (|s|)) time, where H*0(s) is the zeroth order entropy of the string s. Our booster improves A by compressing s within λ|s|H*0(S) + log2 |s| + gk bits still using O(T (|s|)) time, where H*k(s) is the k-th order entropy of s.The idea of a "compression booster" has been very recently introduced by Giancarlo and Sciortino in [7]. They combined the Burrows-Wheeler Transform [3] with dynamic programming and achieved our same compression bound but with running time O(T (|s|)) + Ω(|s|2). We start from the same premises of [7], but instead of using dynamic programming we design a linear time optimization algorithm based on novel structural properties of the Burrows-Wheeler Transform.