You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
96 6 Anatomy of Spaced Seeds<br />
Pr[s] to denote the probability that s occurs at a position k ≥|s|. For any i, j, and k<br />
such that 1 ≤ i, j ≤ m, 1≤ k ≤|π|, we define<br />
⎧<br />
⎨ Pr[W j [k,|π|−1]] if W i [|π|−k,|π − 1]=W j [0,k − 1];<br />
p (ij)<br />
k<br />
= 1 k = |π| & i = j;<br />
⎩<br />
0 otherwise.<br />
It is easy to see that p (ij)<br />
k<br />
is the conditional probability that W j hits at the position<br />
n + k given that W i hits at position n for k < |π| and n.<br />
Theorem 6.1. Let p j = Pr[W j ] for W j ∈ W π (1 ≤ j ≤ m). Then, for any n ≥|π|,<br />
p j<br />
¯Π n =<br />
Proof. For each 1 ≤ j ≤ m,<br />
|π|−1<br />
∑<br />
k=1<br />
m<br />
∑<br />
i=1<br />
m<br />
|π|<br />
∑ ∑<br />
i=1 k=1<br />
π (i)<br />
n+k p(ij) k<br />
, j = 1,2,...,m. (6.6)<br />
p j<br />
¯Π n<br />
]<br />
= Pr<br />
[Ā0 Ā 1 ···Ā n−1 B ( j)<br />
n+|π|−1<br />
|π|−1<br />
]<br />
]<br />
= ∑ Pr<br />
[Ā0 Ā 1 ···Ā n+k−2 A n+k−1 B ( j)<br />
n+|π|−1<br />
+ Pr<br />
[Ā0 Ā 1 ···Ā n+|π|−2 B ( j)<br />
n+|π|−1<br />
k=1<br />
]<br />
= Pr<br />
[Ā0 Ā 1 ···Ā n+k−2 B (i) j)<br />
n+k−1B( n+|π|−1<br />
+ π ( j)<br />
n+|π|<br />
=<br />
=<br />
=<br />
|π|−1<br />
∑<br />
k=1<br />
|π|−1<br />
∑<br />
k=1<br />
m<br />
m<br />
∑<br />
i=1<br />
m<br />
∑<br />
i=1<br />
|π|<br />
∑ ∑<br />
i=1 k=1<br />
] [<br />
]<br />
Pr<br />
[Ā0 Ā 1 ···Ā n+k−2 B (i)<br />
n+k−1<br />
Pr B ( j)<br />
n+|π|−1 |B(i) n+k−1<br />
+ π ( j)<br />
n+|π|<br />
π (i)<br />
n+k p(ij) k<br />
+ π ( j)<br />
n+|π|<br />
π (i)<br />
n+k p(ij) k<br />
.<br />
This proves formula (6.6) .<br />
Example 6.3. Let π = 1 a ∗1 b , a ≥ b ≥ 1. Then, |π| = a+b+1 and W π = {W 1 ,W 2 } =<br />
{1 a 01 b ,1 a+b+1 }. Then we have<br />
⊓⊔<br />
p (11)<br />
k<br />
p (11)<br />
k<br />
p (11)<br />
|π|<br />
= 1,<br />
= p |π|−k−1 q, k = 1,2,...,b,<br />
= 0, k = b + 1,b + 2,...,|π|−1,