Rank and Select Operations on Binary Strings

A selection of computer codes to support the encyclopedia article are available in the files below.

[1]  Rodrigo González,et al.  Statistical Encoding of Succinct Data Structures , 2006, CPM.

[2]  Naila Rahman,et al.  Engineering the LOUDS Succinct Tree Representation , 2006, WEA.

[3]  Kunihiko Sadakane,et al.  Practical Entropy-Compressed Rank/Select Dictionary , 2006, ALENEX.

[4]  Rajeev Raman,et al.  On the Redundancy of Succinct Data Structures , 2008, SWAT.

[5]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[6]  Guy Joseph Jacobson,et al.  Succinct static data structures , 1988 .

[7]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.

[8]  Naila Rahman,et al.  Engineering succinct DOM , 2008, EDBT '08.

[9]  Rasmus Pagh.  Low Redundancy in Static Dictionaries with Constant Query Time , 2001, SIAM J. Comput..

[10]  Rajeev Raman,et al.  Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.

[11]  Naila Rahman,et al.  A simple optimal representation for balanced parentheses , 2006, Theor. Comput. Sci..

[12]  Alexander Golynski.  Optimal lower bounds for rank and select indexes , 2007, Theor. Comput. Sci..

[13]  Torben Hagerup,et al.  Sorting and Searching on the Word RAM , 1998, STACS.

[14]  Mikkel Thorup,et al.  Time-space trade-offs for predecessor search , 2006, STOC '06.

[15]  Emanuele Viola,et al.  Cell-probe lower bounds for succinct partial sums , 2010, SODA '10.

[16]  Naila Rahman,et al.  Compressed Prefix Sums , 2007, SOFSEM.

[17]  Richard Durbin,et al.  Sequence analysis Fast and accurate short read alignment with Burrows – Wheeler transform , 2009 .

[18]  Paolo Ferragina,et al.  A simple storage scheme for strings achieving entropy bounds , 2007, SODA '07.

[19]  Roberto Grossi,et al.  Squeezing succinct data structures into entropy bounds , 2006, SODA '06.

[20]  David R. Clark,et al.  Efficient suffix trees on secondary storage , 1996, SODA '96.

[21]  Peter Elias,et al.  Efficient Storage and Retrieval by Content and Address of Static Files , 1974, JACM.

[22]  Gonzalo Navarro,et al.  Compressed full-text indexes , 2007, CSUR.

[23]  Fabrizio Luccio,et al.  Compressing and indexing labeled trees, with applications , 2009, JACM.

[24]  David Richard Clark,et al.  Compact pat trees , 1998 .

[25]  Gonzalo Navarro,et al.  Fast in-memory XPath search using compressed indexes , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

[26]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[27]  Joong Chae Na,et al.  Efficient Implementation of Rank and Select Functions for Succinct Representation , 2005, WEA.