Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Corpus for the Evaluation of Lossless Compression Algorithms
DCC '97 Proceedings of the Conference on Data Compression
A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation
DCC '98 Proceedings of the Conference on Data Compression
Word-based block-sorting text compression
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Enhanced word-based block-sorting text compression
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Space-Time Tradeoffs in the Inverse B-W Transform
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
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
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
An efficient, versatile approach to suffix sorting
Journal of Experimental Algorithmics (JEA)
Fast BWT in small space by blockwise suffix sorting
Theoretical Computer Science
Parallel lossless data compression using the Burrows-Wheeler Transform
International Journal of Web and Grid Services
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the number of elements to reorder when updating a suffix array
Journal of Discrete Algorithms
Revisiting bounded context block-sorting transformations
Software—Practice & Experience
Optimal lightweight construction of suffix arrays for constant alphabets
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Parallel suffix array and least common prefix for the GPU
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
Brief announcement: truly parallel burrows-wheeler compression and decompression
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Faster semi-external suffix sorting
Information Processing Letters
| Hi-index | 0.01 |
In recent years, lossless text compression based on the Burrows-Wheeler Transform (BWT) has grown popular. The expensive activity during compression is sorting of all the rotations of the block of data to compress. Burrows and Wheeler (1994) describe an efficient implementation of rotation sorting, but give little analysis of its performance this paper addresses that need.We present the base algorithm using a more formal framework, describe two important optimizations not present in the original paper, and measure performance of the variants on a set of 14 files. For completeness, a tuned implementation of Sadakane's rotation sorting algorithm was also tested.