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(7ZSN_1)}(2) \setminus P_{f(8DTL_1)}(2)|=176\),
\(|P_{f(8DTL_1)}(2) \setminus P_{f(7ZSN_1)}(2)|=11\).
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:1001000000000101110000001011110101111100010010110010110110001110110111111010101110101010010111010111011011110011100111110101011011110001011110100110110000110011110010000100011001001100001001001111110100110001100111011110011011110001101111011000111000010010000111110011001001101111011110010
Pair
\(Z_2\)
Length of longest common subsequence
7ZSN_1,8DTL_1
187
3
7ZSN_1,1DGN_1
181
3
8DTL_1,1DGN_1
100
2
Newick tree
[
7ZSN_1:10.24,
[
1DGN_1:50,8DTL_1:50
]:52.24
]
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{320
}{\log_{20}
320}-\frac{31}{\log_{20}31})=94.6\)
Status
Protein1
Protein2
d
d1/2
Query variables
7ZSN_1
8DTL_1
120
66
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}
\]