Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A Fast Block-Sorting Algorithm for Lossless Data Compression
DCC '97 Proceedings of the Conference on Data Compression
Modifications of the Burrows and Wheeler Data Compression Algorithm
DCC '99 Proceedings of the Conference on Data Compression
DNA Sequence Compression Using the Burrows-Wheeler Transform
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Image Compression Using Blocksort
DCC '01 Proceedings of the Data Compression Conference
Prototyping of Efficient Hardware Algorithms for Data Compression in Future Communication Systems
RSP '01 Proceedings of the 12th International Workshop on Rapid System Prototyping
Inverting the Burrows—Wheeler transform
Journal of Functional Programming
Antisequential Suffix Sorting for BWT-Based Data Compression
IEEE Transactions on Computers
The Performance of Linear Time Suffix Sorting Algorithms
DCC '05 Proceedings of the Data Compression Conference
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
SIAM Journal on Computing
Unifying The Burrows-Wheeler and The Schindler Transforms
DCC '06 Proceedings of the Data Compression Conference
An Efficient Algorithm For The Inverse ST Problem
DCC '07 Proceedings of the 2007 Data Compression Conference
Efficient Algorithms for the Inverse Sort Transform
IEEE Transactions on Computers
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
Linear-time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Simple linear work suffix array construction
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler Transform (BWT) by sorting the limited order contexts. However, the best result obtained so far for the inverse ST has a time complexity O(Nlog k) and a space complexity O(N), where N and k are the text size and the context order of the transform, respectively. In this article, we present a novel algorithm that can compute the inverse ST for any k-order contexts in an O(N) time and space complexity, a linear result independent of k. The main idea behind the design of this linear algorithm is a set of cycle properties of k-order contexts that we explore for this work. These newly discovered cycle properties allow us to quickly compute the Longest Common Prefix (LCP) between any pair of adjacent k-order contexts that may belong to two different cycles, which eventually leads to the proposed linear-time solution.