The myriad virtues of wavelet trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 560-571

  Ferragina, Paolo ^a   Giancarlo, Raffaele ^b   Manzini, Giovanni ^c  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF PALERMO   (Italy)

^c UNIVERSITY OF EASTERN PIEDMONT   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; DATA COMPRESSION; DATA STRUCTURES; MATHEMATICAL TRANSFORMATIONS; WAVELET TRANSFORMS;

BINARY COMPRESSORS; BURROWS-WHEELER TRANSFORM; GENERALIZED WAVELET TREES; NON-BINARY COMPRESSORS; WAVELET TREES;

TREES (MATHEMATICS);

EID: 33746345004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_49     Document Type: Conference Paper

References (11)

1. J. Abel, Improvements to the Burrows-Wheeler compression algorithm: After BWT stages, http://citeseer.ist.psu.edu/abel03improvements.html.
2. Z. Arnavut and S. Magliveras, Block sorting and compression. In DCC: Data Compression Conference, pages 181-190. IEEE Computer Society TCC, 1997.
3. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
4. P. Ferragina, R. Giancarlo, G. Manzini, and M. Sciortino, Boosting textual compression in optimal linear time. Journal of the ACM, 52:688-713, 2005.
5. P. Ferragina and G. Manzini. Indexing compressed text. Journal of the ACM, 52(4):552-581, 2005.
6. L. Foschini, R. Grossi, A. Gupta, and J. Vitter. Fast compression with a static model in high order entropy. In DCC: Data Compression Conference, pages 62-71. IEEE Computer Society TCC, 2004.
7. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. 14th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA '03), pages 841-850, 2003.
8. R. Grossi, A. Gupta, and J. Vitter. When indexing equals compression: Experiments on compressing suffix arrays and applications. In Proc. 15th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA '04), pages 636-645, 2004.
9. R. Grossi and J. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing, 35:378-407, 2005.
10. V. Mäkinen and G. Navarro. Succinct suffix arrays based on rul-length encoding. Nordic Journal of Computing, 12(1):40-66, 2005.
11. G. Manzini. An analysis of the Burrows-Wheeler transform. Journal of the ACM, 48(3):407-430, 2001.