A Fast Block-Sorting Algorithm for Lossless Data Compression
DCC '97 Proceedings of the Conference on Data Compression
Efficient Algorithms for the Inverse Sort Transform
IEEE Transactions on Computers
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
Novel and Generalized Sort-Based Transform for Lossless Data Compression
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Revisiting bounded context block-sorting transformations
Software—Practice & Experience
| Hi-index | 0.00 |
The GRP transform, or the generalized radix permutation transform was proposed as a parametric generalization of the BWT of the block-sorting data compression algorithm. This paper develops its extension that can be applied with any combination of parameters. By using the technique developed for linear time/space implementation of the sort transform, we propose an efficient implementation for the inverse transformation of the GRP transform. It works for arbitrary parameter values, and can convert the transformed string to the original string in time linear in the string length.