On wavelet tree construction

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

Volumn 6661 LNCS, Issue , 2011, Pages 208-218

  Tischler, German ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACT DATA STRUCTURE; SPACE EFFICIENT ALGORITHMS; WAVELET TREE;

ALGORITHMS; BINARY SEQUENCES; DATA COMPRESSION; DATA STRUCTURES; ELECTROSTATIC DISCHARGE; PATTERN MATCHING; PLANT EXTRACTS; QUERY PROCESSING;

TREES (MATHEMATICS);

EID: 79960104270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21458-5_19     Document Type: Conference Paper

References (10)

1. Ferragina, P., Giancarlo, R., Manzini, G.: The myriad virtues of wavelet trees. Inf. Comput. 207(8), 849-866 (2009)
2. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: An alphabet-friendly FMindex. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol. 3246, pp. 150-160. Springer, Heidelberg (2004)
3. Franceschini, G., Muthukrishnan, S.M., Pǎtraşcu, M.: Radix sorting with no extra space. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 194-205. Springer, Heidelberg (2007)
4. Gagie, T., Puglisi, S., Turpin, A.: Range quantile queries: Another virtue of wavelet trees. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 1-6. Springer, Heidelberg (2009)
5. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: SODA, pp. 841-850 (2003)
6. Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proceedings of the Institute of Radio Engineers 40(9), 1098-1101 (1952)
7. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918-936 (2006)
8. Kronrod, M.A.: Optimal ordering algorithm without operational field. Soviet Math. Dokl. 10, 744-746 (1969)
9. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. Theoretical Computer Science 387(3), 332-347 (2007); The Burrows-Wheeler Transform
10. Salowe, J., Steiger, W.: Simplified stable merging tasks. J. Algorithms 8(4), 557-571 (1987)