Table 1 Step-by-step computation of the encoding of the prefix of length 6 of the Q-gram x[ 0+Q] in little-endian notation using Eq. (1)
From: Efficient computation of spaced seed hashing with block indexing
0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | |
|---|---|---|---|---|---|---|---|---|---|---|
x | A | C | T | G | A | C | T | G | G | A |
Q | 1 | 1 | 0 | 1 | 1 | 1 | 0 | 0 | 1 | 1 |
m | 0 | 1 | 2 | 2 | 3 | 4 | 4 | 5 | 5 | 6 |
Shifted-encodings | 00 | 01 ≪ 2 | 10 ≪ 4 | 00 ≪ 6 | 01 ≪ 8 | 10 ≪ 10 | ||||
0100 | ||||||||||
100100 | ||||||||||
00100100 | ||||||||||
0100100100 | ||||||||||
100100100100 | ||||||||||