Rank/select operations on large alphabets: A tool for text indexing

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 368-373

  Golynski, Alexander ^a   Ian Munro, J ^a   Srinivasa Rao, S ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; PROBLEM SOLVING; QUERY LANGUAGES; TEXT PROCESSING;

ALPHABETS; BINARY STRINGS; TEXT INDEXING;

INDEXING (OF INFORMATION);

EID: 33244456092     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109599     Document Type: Conference Paper

References (14)

1. D. R. Clark and J. I. Munro. Efficient suffix trees on secondary storage. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 383-391, 1996.
2. P. Ferragina, F. Luccio, G. Manzini, and S. Muthukrishnan. Structuring labeled trees for optimal succinctness, and beyond. Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science, 2005.
3. Paolo Ferragina and Giovanni Manzini. Opportunistic data structures with applications. In Proceedings of 41st Annual IEEE Symposium on Foundations of Computer Science, pages 390-398, 2000.
4. Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, and Gonzalo Navarro. An alphabet-friendly FM-index. In Proceedings of the 11th Symposium on String Processing and Information Retrieval, pages 150-160, 2004.
5. Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, and Gonzalo Navarro. Succinct representation of sequences. Technical Report TR/DCC-2004-5, Department of Computer Science, University of Chile, August 2004.
6. Roberto Grossi, Ankur Gupta, and Jeffrey Scott Vitter. High-order entropy-compressed text indexes. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 841-850, 2003.
7. Roberto Grossi and Kunihiko Sadakane. Squeezing succinct data structures into entropy bounds. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, 2006.
8. Meng He, J. Ian Munro, and S. Srinivasa Rao. A categorization theorem on suffix arrays with applications to space efficient text indexes. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 23-32, 2005.
9. G. Jacobson. Space-efficient static trees and graphs. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pages 549-554, 1989.
10. Veli Mäkinen and Gonzalo Navarro. New search algorithms and time/space tradeoffs for succinct suffix arrays. Technical Report C-2004-20, Univ. Helsinki, Dept. CS, April 2004.
11. J. Ian Munro, Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct representations of permutations. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming, pages 345-356, 2003.
12. Rasmus Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2):353-363, 2001.
13. Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applicationsto encoding k-ary trees and multisets. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 233-242, 2002.
14. Dan E. Willard. Log-logarithmic worst-case range queries are possible in space theta(n). Information Processing Letters, 17(2):81-84, 1983.