Table 3:
Hash table information. We have a total of 11 indices. At each index, the corresponding
k
-mer’s quotient, hash function, and its neighbour information are saved.
Index
Information
0
2–1–
T
1
5–1
2
5–1–
T
3
3–2–
G
4
0–0
5
2–1–
T
6
0–0
7
0–0
8
4–1–
T
9
0–0
10
0–0