Skip to main content
Fig. 2 | BMC Bioinformatics

Fig. 2

From: GVC: efficient random access compression for gene sequence variations

Fig. 2

Example for \({\mathcal {G}} = \begin{array}{ll} 0\mid 2 &{} 2/0 \\ 1/0 &{} 0 \mid 0 \end{array}\). Bit plane binarization yields two bit planes representing the most significant bit and the less significant bit of \(\mathcal {A}\). Row binarization generates only three binary rows because the first row of \(\mathcal {A}\) requires two bits and the second row of \(\mathcal {A}\) requires only one bit

Back to article page