Table 1 q-gram profiles of strings x and y and q-gram distance \(D_{q}(x, y) = 8\) between them
From: Circular sequence comparison: algorithms and applications
(a) \(G_q(x)\) | |
 \(\texttt {AAA}\) | 0 |
 \(\texttt {AGC}\) | 0 |
 \(\texttt {AGT}\) | 1 |
 \(\texttt {CCC}\) | 0 |
 \(\texttt {CTA}\) | 1 |
 \(\texttt {GAG}\) | 1 |
 \(\texttt {GCG}\) | 0 |
 \(\texttt {GGA}\) | 1 |
 \(\texttt {GGG}\) | 0 |
 \(\texttt {GTC}\) | 1 |
 \(\texttt {TAG}\) | 0 |
 \(\texttt {TCT}\) | 1 |
 \(\texttt {TTC}\) | 0 |
 \(\texttt {TTT}\) | 0 |
(b) \(G_q(y)\) | |
 \(\texttt {AAA}\) | 0 |
 \(\texttt {AGC}\) | 1 |
 \(\texttt {AGT}\) | 0 |
 \(\texttt {CCC}\) | 0 |
 \(\texttt {CTA}\) | 1 |
 \(\texttt {GAG}\) | 0 |
 \(\texttt {GCG}\) | 1 |
 \(\texttt {GGA}\) | 0 |
 \(\texttt {GGG}\) | 0 |
 \(\texttt {GTC}\) | 0 |
 \(\texttt {TAG}\) | 1 |
 \(\texttt {TCT}\) | 1 |
 \(\texttt {TTC}\) | 1 |
 \(\texttt {TTT}\) | 0 |
(c) \(D_{q}(x, y)\) | |
 \(\texttt {AAA}\) | 0 |
 \(\texttt {AGC}\) | 1 |
 \(\texttt {AGT}\) | 1 |
 \(\texttt {CCC}\) | 0 |
 \(\texttt {CTA}\) | 0 |
 \(\texttt {GAG}\) | 1 |
 \(\texttt {GCG}\) | 1 |
 \(\texttt {GGA}\) | 1 |
 \(\texttt {GGG}\) | 0 |
 \(\texttt {GTC}\) | 1 |
 \(\texttt {TAG}\) | 1 |
 \(\texttt {TCT}\) | 0 |
 \(\texttt {TTC}\) | 1 |
 \(\texttt {TTT}\) | 0 |