Skip to main content

Table 2 Example of Monotone Value (MOV) Coding.

From: Data structures and compression algorithms for high-throughput sequencing technologies

Number

Encoding

1

1

2

10

3

11

9

1001

14

1110

26

11010

29

11101

  1. The principle is illustrated using the vector of addresses (1, 2, 3, 9, 14, 26, 29). Each integer j is converted to a binary representation of length ⌊log j⌋ which begins with a 1-bit. 0-bits are used between two consecutive integers only when the length (scale) increases. The number of 0-bits is equal to the increase in the length. The final encoding of the vector is 1 0 10 11 00 1001 1110 0 11010 11101
Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us