Data structure for rank and select of pattern on bit vector with constant query time
Looking through literature on advanced data structures and some implementations of balanced parenthesis representations I have stumbled upon proofs making use of rank and select operations on bit vectors, but not for single characters but for the sequences of constant size (eg. ’10’).