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(6AMG_1)}(2) \setminus P_{f(1SBN_1)}(2)|=76\),
\(|P_{f(1SBN_1)}(2) \setminus P_{f(6AMG_1)}(2)|=84\).
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:1101000110011111101111011110010010011001010000111010100011111101010010000111101001010100110100010100101110011111001010101011101011111100000010011011111100001001110000001100000110011100101110110100
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{471
}{\log_{20}
471}-\frac{196}{\log_{20}196})=80.2\)
Status
Protein1
Protein2
d
d1/2
Query variables
6AMG_1
1SBN_1
98
85.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}
\]