-
AFE
-
Lehre
-
Algorithmische Grundlagen
Theses
of elements, type of element). Looking at the previous example, RLE( B ) = (1,0), (1,1), (3,0), (2,1), (1,0), (1,1), (1,0), (4,1). Combining compressed and dynamic bitvectors supporting rank/select operations [...] rank query on a bitvector B returns the number of bits of type b = {0, 1} that occur before a given position i , i.e. rank b (i) = |{j : 0 <= j < i, B[j] = b}| . The select operation is the inverse of the [...] k} . For example, given a bitvector B = 01000110101111, we have that query rank 1 (5) = 1 and select 0 (6) = 10 . There exist numerous solutions for these two types of queries that run in constant time and …
