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(8DOG_1)}(2) \setminus P_{f(7ODT_1)}(2)|=38\),
\(|P_{f(7ODT_1)}(2) \setminus P_{f(8DOG_1)}(2)|=139\).
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:11000110101010001001111110001000001000110000010011011000001101110110010001111001001101000011001010011111100101010010000100110011011001110
Pair
\(Z_2\)
Length of longest common subsequence
8DOG_1,7ODT_1
177
3
8DOG_1,4ZYX_1
158
3
7ODT_1,4ZYX_1
159
3
Newick tree
[
7ODT_1:85.75,
[
8DOG_1:79,4ZYX_1:79
]:6.75
]
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{543
}{\log_{20}
543}-\frac{137}{\log_{20}137})=118.\)
Status
Protein1
Protein2
d
d1/2
Query variables
8DOG_1
7ODT_1
148
98.5
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}
\]