Issue No. 04 - April (2005 vol. 54)

ISSN: 0018-9340

pp: 385-397

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2005.56

Dror Baron , IEEE

Yoram Bresler , IEEE

ABSTRACT

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.

INDEX TERMS

Burrows Wheeler transform, data compression, source coding, suffix sorting, VLSI.

CITATION

Dror Baron, Yoram Bresler, "Antisequential Suffix Sorting for BWT-Based Data Compression",

*IEEE Transactions on Computers*, vol. 54, no. , pp. 385-397, April 2005, doi:10.1109/TC.2005.56