Antisequential suffix sorting for BWT-based data compression

@article{Baron2005AntisequentialSS,
  title={Antisequential suffix sorting for BWT-based data compression},
  author={Dror Baron and Yoram Bresler},
  journal={IEEE Transactions on Computers},
  year={2005},
  volume={54},
  pages={385-397}
}
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 length-N input over a size-|X| alphabet, the worst-case complexities of these algorithms are /spl Theta/(N/sup 2/), O(|X|N log(N… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-6 of 6 extracted citations

An FPGA-based parallel sorting architecture for the Burrows Wheeler transform

2005 International Conference on Reconfigurable Computing and FPGAs (ReConFig'05) • 2005
View 4 Excerpts
Highly Influenced

Data compression in hardware — The Burrows-Wheeler approach

13th IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems • 2010

Efficient Algorithms for the Inverse Sort Transform

IEEE Transactions on Computers • 2007
View 3 Excerpts

References

Publications referenced by this paper.
Showing 1-10 of 35 references

Faster suffix sorting

Theor. Comput. Sci. • 2007
View 8 Excerpts
Highly Influenced

Fast Parallel Algorithms for Universal Lossless Source Coding

D. Baron
PhD dissertation, Univ. of Illinois, Urbana, Feb. 2003. • 2003
View 13 Excerpts
Highly Influenced

On the Performance of BWT Sorting Algorithms

Data Compression Conference • 2000
View 4 Excerpts
Highly Influenced

Reducing the space requirement of suffix trees

Softw., Pract. Exper. • 1999
View 9 Excerpts
Highly Influenced

Extended Application of Suffix Trees to Data Compression

Data Compression Conference • 1996
View 4 Excerpts
Highly Influenced

On-line construction of suffix trees

Algorithmica • 1995
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…