Interval and recency rank source coding: two on-line adaptive variable-length schemes
IEEE Transactions on Information Theory
Introduction to algorithms
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Reducing the space requirement of suffix trees
Software—Practice & Experience
Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice
IEEE Transactions on Computers
A Low-Power CAM Design for LZ Data Compression
IEEE Transactions on Computers
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Extended application of suffix trees to data compression
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
On the Performance of BWT Sorting Algorithms
DCC '00 Proceedings of the Conference on Data Compression
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Unbounded length contexts for PPM
DCC '95 Proceedings of the Conference on Data Compression
Space-Time Tradeoffs in the Inverse B-W Transform
DCC '01 Proceedings of the Data Compression Conference
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Fast parallel algorithms for universal lossless source coding
Fast parallel algorithms for universal lossless source coding
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference 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
Fast universal coding with context models
IEEE Transactions on Information Theory
Universal lossless source coding with the Burrows Wheeler transform
IEEE Transactions on Information Theory
An O(N) semipredictive universal encoder via the BWT
IEEE Transactions on Information Theory
The context-tree weighting method: basic properties
IEEE Transactions on Information Theory
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
Efficient Algorithms for the Inverse Sort Transform
IEEE Transactions on Computers
Computing the inverse sort transform in linear time
ACM Transactions on Algorithms (TALG)
Hi-index | 14.98 |
Suffix sorting requires ordering all suffixes of all symbols in an input sequence and has applications in running queries on large texts and in universal lossless data compression based on the Burrows Wheeler transform (BWT). We propose a new suffix lists data structure that leads to three fast, antisequential, and memory-efficient algorithms for suffix sorting. For a {\rm length}{\hbox{-}}N input over a {\rm size}{\hbox{-}}|{\cal X}| alphabet, the worst-case complexities of these algorithms are \Theta(N^2), O(|{\cal X}|N\log({\frac{N}{|{\cal X}|}})), and O(N\sqrt{|{\cal X}|\log({\frac{N}{|{\cal X}|}})}), respectively. Furthermore, simulation results indicate performance that is competitive with other suffix sorting methods. In contrast, the suffix sorting methods that are fastest on standard test corpora have poor worst-case performance. Therefore, in comparison with other suffix sorting methods, suffix lists offer a useful trade off between practical performance and worst-case behavior. Another distinguishing feature of suffix lists is that these algorithms are simple; some of them can be implemented in VLSI. This could accelerate suffix sorting by at least an order of magnitude and enable high-speed BWT-based compression systems.