The myriad virtues of Wavelet Trees

Information and Computation

Volumn 207, Issue 8, 2009, Pages 849-866

  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

ARITHMETIC ENCODER; COMPRESSION ALGORITHMS; DATA COMPRESSION ALGORITHMS; FLEXIBLE TOOL; HUFFMAN; NON-BINARY; RUN LENGTH; TEXT-INDEXING; WAVELET TREE;

BINARY TREES;

DATA COMPRESSION;

EID: 67349112389     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.12.010     Document Type: Article

References (20)

1. J. Abel, Improvements to the Burrows-Wheeler compression algorithm: after BWT stages. Available from: .
2. Apostolico A., and Fraenkel A.S. Robust transmission of unbounded strings using Fibonacci representations. IEEE Transactions on Information Theory 33 (1987) 238-245
3. Arnavut Z. Inversion coding. The Computer Journal 47 (2004) 46-57
4. Z. Arnavut, S. Magliveras, Block sorting and compression, in: Proceedings of IEEE Data Compression Conference (DCC), 1997, pp. 181-190.
5. M. Burrows, D. Wheeler, A block-sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
6. Elias P. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 21 2 (1975) 194-203
7. P. Ferragina, R. Giancarlo, G. Manzini, The engineering of a compression boosting library: theory vs practice in BWT compression, in: Proceedings of the 14th European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, vol. 4168, Springer, 2006, pp. 756-767.
8. P. Ferragina, R. Giancarlo, G. Manzini, The myriad virtues of wavelet trees, in: Proceedings of the 33rd International Colloquium on Automata and Languages (ICALP), Lecture Notes in Computer Science, vol. 4051, Springer, 2006, pp. 561-572.
9. Ferragina P., Giancarlo R., Manzini G., and Sciortino M. Boosting textual compression in optimal linear time. Journal of the ACM 52 (2005) 688-713
10. L. Foschini, R. Grossi, A. Gupta, J. Vitter, Fast compression with a static model in high-order entropy, in: Proceedings of IEEE Data Compression Conference (DCC), 2004, pp. 62-71.
11. Foschini L., Grossi R., Gupta A., and Vitter J. When indexing equals compression: experiments on compressing suffix arrays and applications. ACM Transactions on Algorithms 2 (2006) 611-639
12. T. Gagie, G. Manzini, Move-to-front, distance coding, and inversion frequencies revisited, Technical Report TR-INF-2008-03-02-UNIPMN, Dipartimento di Informatica, Università Piemonte Orientale, 2008. Available from: .
13. R. Grossi, A. Gupta, J. Vitter, High-order entropy-compressed text indexes, in: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2003, pp. 841-850.
14. L. Foschini, R. Grossi, A. Gupta, J. Vitter, Fast compression with a static model in high-order entropy, in: Proceedings of IEEE Data Compression Conference (DCC), 2004, pp. 62-71.
15. Lakshmanan K.B. On universal codeword sets. IEEE Transactions in Information Theory 27 (1981) 659-662
16. Mäkinen V., and Navarro G. Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing 12 1 (2005) 40-66
17. V. Mäkinen, G. Navarro, Implicit compression boosting with applications to self-indexing, in: Proceedings of the 14th Symposium on String Processing and Information Retrieval (SPIRE'07), LNCS No. 4726, Springer-Verlag, 2007, pp. 214-226.
18. Manzini G. An analysis of the Burrows-Wheeler transform. Journal of the ACM 48 3 (2001) 407-430
19. Navarro G., and Mäkinen V. Compressed full-text indexes. ACM Computing Surveys 39 1 (2007)
20. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 233-242.