An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Efficient Algorithms foe On-Line Symbol Ranking Compression
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Move-to-Front and Inversion Coding
DCC '00 Proceedings of the Conference on Data Compression
Can We Do without Ranks in Burrows Wheeler Transform Compression?
DCC '01 Proceedings of the Data Compression Conference
Image Compression Using Blocksort
DCC '01 Proceedings of the Data Compression Conference
Inverting the Burrows—Wheeler transform
Journal of Functional Programming
Antisequential Suffix Sorting for BWT-Based Data Compression
IEEE Transactions on Computers
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)
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
Effective asymmetric XML compression
Software—Practice & Experience
Computing Inverse ST in Linear Complexity
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Novel and Generalized Sort-Based Transform for Lossless Data Compression
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
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
Extension and faster implementation of the GRP transform for lossless compression
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)
A fast suffix-sorting algorithm
General Theory of Information Transfer and Combinatorics
Revisiting bounded context block-sorting transformations
Software—Practice & Experience
Efficient indexing algorithms for approximate pattern matching in text
Proceedings of the Seventeenth Australasian Document Computing Symposium
| Hi-index | 0.02 |