New lower and upper bounds for representing sequences

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

Volumn 7501 LNCS, Issue , 2012, Pages 181-192

  Belazzougui, Djamal ^a   Navarro, Gonzalo ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER AND UPPER BOUNDS; LOWER BOUNDS; UPPER BOUND;

DATA STRUCTURES;

ALGORITHMS;

EID: 84866648845     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33090-2_17     Document Type: Conference Paper

References (29)

1. Barbay, J., Gagie, T., Navarro, G., Nekrich, Y.: Alphabet Partitioning for Compressed Rank/Select and Applications. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010, Part II. LNCS, vol. 6507, pp. 315-326. Springer, Heidelberg (2010)
2. 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)
3. Barbay, J., Navarro, G.: Compressed representations of permutations, and applications. In: Proc. 26th STACS, pp. 111-122 (2009)
4. Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: searching a sorted table with o(1) accesses. In: Proc. 20th SODA, pp. 785-794 (2009)
5. Belazzougui, D., Navarro, G.: New lower and upper bounds for representing sequences. CoRR, arXiv:1111.26211v1 (2011) http://arxiv.org/abs/1111.2621v1
6. Clark, D.: Compact Pat Trees. PhD thesis, University of Waterloo, Canada (1996)
7. Claude, F., Navarro, G.: Extended Compact Web Graph Representations. In: Elomaa, T., Mannila, H., Orponen, P. (eds.) Ukkonen Festschrift 2010. LNCS, vol. 6060, pp. 77-91. Springer, Heidelberg (2010)
8. Ferragina, P., Luccio, F., Manzini, G., Muthukrishnan, S.: Compressing and indexing labeled trees, with applications. Journal of the ACM 57(1) (2009)
9. Ferragina, P., Manzini, G.: Indexing compressed texts. Journal of the ACM 52(4), 552-581 (2005)
10. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms 3(2), article 20 (2007)
11. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science 372(1), 115-121 (2007)
12. Gagie, T.: Large alphabets and incompressibility. Information Processing Letters 99(6), 246-251 (2006)
13. Gagie, T., Navarro, G., Puglisi, S.J.: Colored Range Queries and Document Retrieval. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 67-81. Springer, Heidelberg (2010)
14. Golynski, A.: Optimal lower bounds for rank and select indexes. Theoretical Computer Science 387(3), 348-359 (2007)
15. Golynski, A.: Cell probe lower bounds for succinct data structures. In: Proc. 20th SODA, pp. 625-634 (2009)
16. Golynski, A., Munro, I., Rao, S.: Rank/select operations on large alphabets: a tool for text indexing. In: Proc. 17th SODA, pp. 368-373 (2006)
17. Golynski, A., Raman, R., Rao, S.S.: On the Redundancy of Succinct Data Structures. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 148-159. Springer, Heidelberg (2008)
18. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th SODA, pp. 841-850 (2003)
19. Grossi, R., Orlandi, A., Raman, R.: Optimal Trade-Offs for Succinct String Indexes. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 678-689. Springer, Heidelberg (2010)
20. Gupta, A., Hon, W.-K., Shah, R., Vitter, J.: Dynamic rank/select dictionaries with applications to XML indexing. Technical Report CSD TR #06-014, Purdue University (July 2006)
21. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549-554 (1989)
22. Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM 48(3), 407-430 (2001)
23. Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996)
24. 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)
25. Patrascu, M.: Succincter. In: Proc. 49th FOCS, pp. 305-313 (2008)
26. Patrascu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: Proc. 38th STOC, pp. 232-240 (2006)
27. Patrascu, M., Thorup, M.: Time-space trade-offs for predecessor search. CoRR, cs/0603043v1 (2008), http://arxiv.org/pdf/cs/0603043v1
28. Patrascu, M., Viola, E.: Cell-probe lower bounds for succinct partial sums. In: Proc. 21st SODA, pp. 117-122 (2010)
29. Välimäki, N., Mäkinen, V.: Space-Efficient Algorithms for Document Retrieval. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 205-215. Springer, Heidelberg (2007)