Burrows--Wheeler compression with variable length integer codes
Software—Practice & Experience
Compression boosting in optimal linear time using the Burrows-Wheeler Transform
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Boosting textual compression in optimal linear time
Journal of the ACM (JACM)
Context exhumation after the Burrows-Wheeler transform
Information Processing Letters
When indexing equals compression: Experiments with compressing suffix arrays and applications
ACM Transactions on Algorithms (TALG)
Lossless and Near-Lossless Compression of Ecg Signals with Block-Sorting Techniques
International Journal of High Performance Computing Applications
Efficient Algorithms for the Inverse Sort Transform
IEEE Transactions on Computers
Burrows–Wheeler compression: Principles and reflections
Theoretical Computer Science
A simpler analysis of Burrows–Wheeler-based compression
Theoretical Computer Science
Stream-oriented lossless packet compression in wireless sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Context exhumation after the Burrows--Wheeler transform
Information Processing Letters
Move-to-Front, Distance Coding, and Inversion Frequencies revisited
Theoretical Computer Science
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)
A simpler analysis of burrows-wheeler based compression
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Efficient adaptive data compression using fano binary search trees
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Revisiting bounded context block-sorting transformations
Software—Practice & Experience
Move-to-front, distance coding, and inversion frequencies revisited
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Most burrows-wheeler based compressors are not optimal
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.01 |