Space efficient wavelet tree construction

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

Volumn 7024 LNCS, Issue , 2011, Pages 185-196

  Claude, Francisco ^a   Nicholson, Patrick K ^a   Seco, Diego ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING BLOCKES; CONSTRUCTION ALGORITHMS; MASSIVE DATA SETS; SPACE EFFICIENT; WAVELET TREE;

ALGORITHMS; DATA STRUCTURES; INFORMATION RETRIEVAL; PLANT EXTRACTS;

TREES (MATHEMATICS);

EID: 80053950278     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24583-1_19     Document Type: Conference Paper

References (25)

1. Arroyuelo, D., Navarro, G.: Space-efficient construction of lempel-ziv compressed text indexes. Information and Computation 209(7), 1070-1102 (2011)
2. Arroyuelo, D., Cánovas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Proc. ALENEX, pp. 84-97 (2010)
3. Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: Proc. STACS, pp. 111-122 (2009)
4. Barbay, J., Claude, F., Navarro, G.: Compact rich-functional binary relation representations. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 170-183. Springer, Heidelberg (2010)
5. Bose, P., He, M., Maheshwari, A., Morin, P.: Succinct orthogonal range search structures on a grid with applications to text indexing. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 98-109. Springer, Heidelberg (2009)
6. Clark, D.: Compact Pat Trees. Ph.D. thesis, University of Waterloo (1996)
7. Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. SODA, pp. 383-391 (1996)
8. Claude, F., Navarro, G.: Practical rank/select queries over arbitrary sequences. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 176-187. Springer, Heidelberg (2008)
9. Claude, F., Navarro, G.: Self-indexed text compression using straight-line programs. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 235-246. Springer, Heidelberg (2009)
10. Claude, F., Fariña, A., Martínez-Prieto, M., Navarro, G.: Compressed q-gram indexing for highly repetitive biological sequences. In: Proc. BIBE, pp. 86-91 (2010)
11. Farzan, A., Gagie, T., Navarro, G.: Entropy-bounded representation of point grids. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 327-338. Springer, Heidelberg (2010)
12. Farzan, A.: Succinct Representation of Trees and Graphs. Ph.D. thesis, University of Waterloo (2009)
13. Ferragina, P., González, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. ACM JEA 13, 30 pages (2009)
14. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. on Alg. 3(2), article 20(2007)
15. Fich, F., Munro, J.I., Poblete, P.: Permuting in place. SIAM J. on Comp. 24, 266 (1995)
16. Golynski, A., Munro, J.I., Rao, S.S.: Rank/select operations on large alphabets: a tool for text indexing. In: Proc. SODA, pp. 368-373 (2006)
17. Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. SODA, pp. 841-850 (2003)
18. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. FOCS, pp. 549-554 (1989)
19. Keller, J.: A heuristic to accelerate in-situ permutation algorithms. Inf. Proc. Lett. 81(3), 119-125 (2002)
20. Kreft, S., Navarro, G.: Self-indexing based on LZ77. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 41-54. Springer, Heidelberg (2011)
21. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. Theo. Comp. Sci. 387, 332-347 (2007)
22. Mäkinen, V., Välimäki, N.: Personal communication
23. Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996)
24. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Comp. Surv. 39(1), article 2 (2007)
25. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. SODA, pp. 233-242 (2002)