Amortized efficiency of list update and paging rules
Communications of the ACM
Text compression
Arithmetic coding for data compression
Communications of the ACM
ACM Transactions on Information Systems (TOIS)
A compression algorithm for DNA sequences and its applications in genome comparison
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
An analysis of the Burrows—Wheeler transform
Journal of the ACM (JACM)
Compression and Coding Algorithms
Compression and Coding Algorithms
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
A Guaranteed Compression Scheme for Repetitive DNA Sequences
DCC '96 Proceedings of the Conference on Data Compression
A Fast Block-Sorting Algorithm for Lossless Data Compression
DCC '97 Proceedings of the Conference on Data Compression
Compression of Biological Sequences by Greedy Off-Line Textual Substitution
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
PPM Performance with BWT Complexity: A New Method for Lossless Data Compression
DCC '00 Proceedings of the Conference on Data Compression
An Efficient Method for in Memory Construction of Suffix Arrays
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
A Fast Renormalisation for Arithmetic Coding
DCC '98 Proceedings of the Conference on Data Compression
Space-Time Tradeoffs in the Inverse B-W Transform
DCC '01 Proceedings of the Data Compression Conference
Journal of the ACM (JACM)
Boosting textual compression in optimal linear time
Journal of the ACM (JACM)
Data Compression: The Complete Reference
Data Compression: The Complete Reference
ACM Computing Surveys (CSUR)
Linear work suffix array construction
Journal of the ACM (JACM)
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
The engineering of a compression boosting library: theory vs practice in BWT compression
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
An efficient, versatile approach to suffix sorting
Journal of Experimental Algorithmics (JEA)
Efficient Algorithms for the Inverse Sort Transform
IEEE Transactions on Computers
Fast BWT in small space by blockwise suffix sorting
Theoretical Computer Science
RadixZip: linear time compression of token streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
Computing Inverse ST in Linear Complexity
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Compressed text indexes: From theory to practice
Journal of Experimental Algorithmics (JEA)
Engineering Radix Sort for Strings
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Novel and Generalized Sort-Based Transform for Lossless Data Compression
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Extension and faster implementation of the GRP transform for lossless compression
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Medium-space algorithms for inverse BWT
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Space efficient algorithms for the burrows-wheeler backtransformation
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Enhanced byte codes with restricted prefix properties
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Universal lossless source coding with the Burrows Wheeler transform
IEEE Transactions on Information Theory
Efficient indexing algorithms for approximate pattern matching in text
Proceedings of the Seventeenth Australasian Document Computing Symposium
Hi-index | 0.00 |
The Burrows–Wheeler Transform (BWT) produces a permutation of a string X, denoted X∗, by sorting the n cyclic rotations of X into full lexicographical order and taking the last column of the resulting n×n matrix to be X∗. The transformation is reversible in time. In this paper, we consider an alteration to the process, called k-BWT, where rotations are only sorted to a depth k. We propose new approaches to the forward and reverse transform, and show that the methods are efficient in practice. More than a decade ago, two algorithms were independently discovered for reversing k-BWT, both of which run in time. Two recent algorithms have lowered the bounds for the reverse transformation to and, respectively. We examine the practical performance for these reversal algorithms. We find that the original approach is most efficient in practice, and investigates new approaches, aimed at further speeding reversal, which store precomputed context boundaries in the compressed file. By explicitly encoding the context boundaries, we present an reversal technique that is both efficient and effective. Finally, our study elucidates an inherently cache-friendly – and hitherto unobserved – behavior in the reverse k-BWT, which could lead to new applications of the k-BWT transform. In contrast to previous empirical studies, we show that the partial transform can be reversed significantly faster than the full transform, without significantly affecting compression effectiveness. Copyright © 2011 John Wiley & Sons, Ltd.