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(2BDR_1)}(2) \setminus P_{f(6QJG_1)}(2)|=91\),
\(|P_{f(6QJG_1)}(2) \setminus P_{f(2BDR_1)}(2)|=50\).
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:1001110110001110110110001000111001001010011010010100011101101010011101011000111001111111011111111110111011101100010011000011100111010000011110001010000000100001111010010000000
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{279
}{\log_{20}
279}-\frac{104}{\log_{20}104})=55.3\)
Status
Protein1
Protein2
d
d1/2
Query variables
2BDR_1
6QJG_1
71
56
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}
\]