Let \(P_w(n)\) be the set of distinct subwords (intervals) in a word \(w\).
Let \(p_w(n)\) be the cardinality of \(P_w(n)\).
Let \(f(c)\) be the sequence in FASTA with 4-symbol Protein Data Bank code \(c\).
\(|P_{f(7YXT_1)}(2) \setminus P_{f(8QGW_1)}(2)|=145\),
\(|P_{f(8QGW_1)}(2) \setminus P_{f(7YXT_1)}(2)|=44\).
Let
\(
Z_k(x,y)=|P_x(k)\setminus P_y(k)|+|P_y(k)\setminus P_x(k)|
\)
be a LZ76 style (set of subwords) Jaccard distance numerator for \(P(k)\).Hydrophobic-polar version of Sequence 1:110000000000101100100011111101000110100011111001101100101000100101101001000000011011110101101110101010011100111100010111011111101001110100001001100001011101001000011111011101111011011101101101000001101110110010011011001000101011101101010110101010011100111001001111011000110010111110001111011011001000111100011001000101001110010111001001010111010000101100011111000100000000100101010110011011001000000011001
Pair
\(Z_2\)
Length of longest common subsequence
7YXT_1,8QGW_1
189
5
7YXT_1,6SXV_1
158
4
8QGW_1,6SXV_1
205
3
Newick tree
[
8QGW_1:10.29,
[
7YXT_1:79,6SXV_1:79
]:25.29
]
Let d be the
Otu--Sayood
distance d.
Let d1 be the Otu--Sayood distance d1. (This makes the 4TYN sequence AAAAAA a close match...)
A roughly speaking expected distance is \((0.85)(0.8)(\frac{565
}{\log_{20}
565}-\frac{160}{\log_{20}160})=117.\)
Status
Protein1
Protein2
d
d1/2
Query variables
7YXT_1
8QGW_1
148
103
Was not able to put for d Was not able to put for d1
In notation analogous to
[Theorem 16, Kjos-Hanssen, Niraula and Yoon (2022)],
\[
\delta=
\alpha \mathrm{min} + (1-\alpha) \mathrm{max}=
\begin{cases}
d &\alpha=0,\\
d_1/2 &\alpha=1/2
\end{cases}
\]