Alphabet partitioning for compressed rank/select and applications

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

Volumn 6507 LNCS, Issue PART 2, 2010, Pages 315-326

  Barbay, Jérémy ^a   Gagie, Travis ^a   Navarro, Gonzalo ^a   Nekrich, Yakov ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPACT DATA STRUCTURE; CONSTANT TIME; DISJOINT SETS; SELF-INDEX; ZERO-ORDER ENTROPY;

ALGORITHMS; QUALITY ASSURANCE; REDUNDANCY;

DATA STRUCTURES;

EID: 78650873842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17514-5_27     Document Type: Conference Paper

References (22)

1. Andersson, A.: Sorting and searching revisited. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 185-197. Springer, Heidelberg (1996)
2. Barbay, J., Golynski, A., Munro, J.I., Rao, S.S.: Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theoretical Computer Science 387(3), 284-297 (2007) (Pubitemid 47633445)
3. Barbay, J., He, M., Munro, J.I., Rao, S.S.: Succinct indexes for strings, binary relations and multi-labeled trees. In: Proc. 18th SODA, pp. 680-689 (2007)
4. Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: Proc. 26th STACS, pp. 111-122 (2009)
5. Blandford, D., Blelloch, G.: Index compression through document reordering. In: Proc. DCC, pp. 342-351 (2002)
6. Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
7. 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)
8. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms 3(2)
9. Gagie, T., Navarro, G., Nekrich, Y.: Fast and compact prefix codes. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 419-427. Springer, Heidelberg (2010)
10. Golynski, A., Munro, J.I., Rao, S.S.: Rank/select operations on large alphabets: a tool for text indexing. In: Proc. 17th SODA, pp. 368-373 (2006)
11. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th SODA, pp. 841-850 (2003)
12. Hreinsson, J.B., Krøyer, M., Pagh, R.: Storing a compressed function with constant time access. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 730-741. Springer, Heidelberg (2009)
13. Levcopoulos, C., Petersson, O.: Sorting shuffled monotone sequences. Information and Computation 112(1), 37-50 (1994)
14. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. Theoretical Computer Science 387(3), 332-347 (2007)
15. Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM 48(3), 407-430 (2001)
16. Mehlhorn, K.: Sorting presorted files. In: Weihrauch, K. (ed.) GI-TCS 1979. LNCS, vol. 67, pp. 199-212. Springer, Heidelberg (1979)
17. Munro, J.I., Raman, R., Raman, V., Rao, S.S.: Succinct representations of permutations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 345-356. Springer, Heidelberg (2003)
18. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1):article 2 (2007)
19. Rahman, N., Raman, R.: Rank and select operations on binary strings. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms. Springer, Heidelberg (2008)
20. Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th SODA, pp. 233-242 (2002)
21. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48(2), 294-313 (2003)
22. Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. Journal of the ACM 31(2), 245-281 (1984)