Rank and select revisited and extended

Theoretical Computer Science

Volumn 387, Issue 3, 2007, Pages 332-347

  Mäkinen, Veli ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Compressed data structures; Gap encoding; Position restricted substring searching; Range searching; Substring rank and select; Succinct data structures; Wavelet trees

Indexed keywords

ALGORITHMS; DATA COMPRESSION; DATA STRUCTURES; ENCODING (SYMBOLS); TABU SEARCH; TREES (MATHEMATICS);

COMPRESSED DATA STRUCTURES; GAP ENCODING; POSITION-RESTRICTED SUBSTRING SEARCHING; RANGE SEARCHING; SUBSTRING RANK AND SELECT; SUCCINCT DATA STRUCTURES; WAVELET TREES;

WAVELET TRANSFORMS;

EID: 35548988801     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.013     Document Type: Article

References (36)

1. S. Alstrup, G. Brodal, T. Rahue, New data structures for orthogonal range searching, in: Proc. 41st IEEE Symposium on Foundations of Computer Science, FOCS, 2000, pp. 198-207
2. Apostolico A. The myriad virtues of subword trees. Combinatorial Algorithms on Words. NATO ISI Series (1985), Springer-Verlag 85-96
3. Bell T.C., Cleary J.G., and Witten I.H. Text Compression (1990), Prentice Hall, Englewood Cliffs, New Jersey
4. Benoit D., Demaine E., Munro I., Raman R., Raman V., and Rao S. Representing trees of higher degree. Algorithmica 43 (2005) 275-292
5. Bialynicka-Birula I., and Grossi R. Rank-sensitive data structures. Proc. 12th International Symposium on String Processing and Information Retrieval, SPIRE. LNCS vol. 3772 (2005) 79-90
6. D. Blandford, G. Blelloch, Compact representations of ordered sets, in: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2004, pp. 11-19
7. M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994
8. Chazelle B. A functional approach to data structures and its use in multidimensional searching. SIAM Journal on Computing 17 3 (1988) 427-462
9. D. Clark, Compact pat trees, Ph.D. Thesis, University of Waterloo, 1996
10. Elias P. Universal codeword sets and representation of the integers. IEEE Transactions on Information Theory 21 2 (1975) 194-203
11. Ferragina P., Giancarlo R., Manzini G., and Sciortino M. Boosting textual compression in optimal linear time. Journal of the ACM 52 4 (2005) 688-713
12. Ferragina P., and Manzini G. Indexing compressed texts. Journal of the ACM 52 4 (2005) 552-581
13. Ferragina P., Manzini G., Mäkinen V., and Navarro G. An alphabet-friendly FM-index. Proc. 11th International Symposium on String Processing and Information Retrieval, SPIRE. LNCS vol. 3246 (2004) 150-160
14. Ferragina P., Manzini G., Mäkinen V., and Navarro G. Compressed representation of sequences and full-text indexes. ACM Transactions on Algorithms 3 2 (2007) Article 2
15. Ferragina P., and Venturini R. A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science 372 1 (2007) 115-121
16. A. Golynski, Optimal lower bounds for rank and select indexes, Theoretical Computer Science (2007), in press (doi:10.1016/j.tcs.2007.07.041)
17. González R., and Navarro G. Statistical encoding of succinct data structures. Proc. 17th Annual Symposium on Combinatorial Pattern Matching, CPM. LNCS vol. 4009 (2006) 295-306
18. R. Grossi, A. Gupta, J. Vitter, High-order entropy-compressed text indexes, in: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2003, pp. 841-850
19. Grossi R., Gupta A., and Vitter J. When indexing equals compression: Experiments with compressing suffix arrays and applications. ACM Transactions on Algorithms 2 4 (2006) 611-639
20. Grossi R., and Vitter J. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing 35 2 (2006) 378-407
21. A. Gupta, W.-K. Hon, R. Shah, J. Vitter, Compressed dictionaries: Space measures, data sets, and experiments, in: Proc. 5th International Workshop on Experimental Algorithms, WEA, 2006, pp. 158-169
22. G. Jacobson, Space-efficient static trees and graphs, in: Proc. 30th IEEE Symp. Foundations of Computer Science, FOCS, 1989, pp. 549-554
23. G. Jacobson, Succinct static data structures, Ph.D. Thesis, Carnegie Mellon University, 1989
24. J. Kärkkäinen, Repetition-based text indexes, Ph.D. Thesis, Dept. of Computer Science, University of Helsinki, Finland, 1999 (Report A-1999-4)
25. V. Mäkinen, G. Navarro, Dynamic entropy-compressed sequences and full-text indexes, ACM Transactions on Algorithms, 2007 (in press). Earlier in Proc. 17th Annual Symposium on Combinatorial Pattern Matching, CPM, in: LNCS, vol. 4009, 2006, pp. 306-317
26. Manber U., and Myers G. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing (1993) 935-948
27. Manzini G. An analysis of the Burrows-Wheeler transform. Journal of the ACM 48 3 (2001) 407-430
28. Munro I. Tables. Proc. 16th Foundations of Software Technology and Theoretical Computer Science, FSTTCS. LNCS vol. 1180 (1996) 37-42
29. Navarro G. Indexing text using the Ziv-Lempel trie. Journal of Discrete Algorithms 2 1 (2004) 87-114
30. Navarro G., and Mäkinen V. Compressed full-text indexes. ACM Computing Surveys 39 1 (2007) Article 2
31. R. Pagh, Low redundancy in dictionaries with o(1) worst case lookup time, in: Proc. ICALP'99, 1999, pp. 595-604
32. R. Raman, V. Raman, S. Srinivasa Rao, Succinct dynamic data structures, in: Proc. WADS'01, 2001, pp. 426-437
33. R. Raman, V. Raman, S. Srinivasa Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2002, pp. 233-242
34. K. Sadakane, Succinct representations of lcp information and improvements in the compressed suffix arrays, in: Proc. SODA'02, 2002, pp. 225-232
35. Sadakane K. New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48 2 (2003) 294-313
36. K. Sadakane, R. Grossi, Squeezing succinct data structures into entropy bounds, in: Proc. ACM-SIAM Symposium on Discrete Algorithms, SODA, 2006, pp. 1230-1239