Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
124 7 Local Alignment Statistics<br />
Let X i denote the score of the aligned pair at the ith position. Then, X i s are iid<br />
random variables. Let X be a random variable with the same distribution as X i s. The<br />
moment generating function of X is<br />
We consider the accumulative scores:<br />
(<br />
E e θX) c<br />
= ∑ p j e jθ .<br />
j=−d<br />
S 0 = 0,<br />
S j =<br />
j<br />
∑<br />
i=1<br />
X i , j = 1,2,...,<br />
and partition the walk into non-negative excursions between the successive descending<br />
ladder points in the path:<br />
K 0 = 0,<br />
K i = min { }<br />
k | k ≥ K i−1 + 1, S k < S Ki−1 , i = 1,2,.... (7.8)<br />
Because the mean step size is negative, the K i − K i−1 are positive integer-valued<br />
iid random variables. Define Q i to be the maximal score attained during the ith<br />
excursion between K i−1 and K i , i.e.,<br />
( )<br />
Q i = max Sk − S Ki−1 , i = 1,2,.... (7.9)<br />
K i−1 ≤k 0, S i ≤ 0,i = 1,2,...,k − 1}. (7.10)<br />
and set t + = ∞ if S i ≤ 0 for all i. Then t + is the stopping time of the first positive<br />
accumulative score. We define<br />
and<br />
Z + = S t +, t + < ∞ (7.11)<br />
L(y)=Pr[0 < Z + ≤ y]. (7.12)<br />
Lemma 7.1. With notations defined above,<br />
E(K 1 )=exp<br />
{ ∞∑<br />
k=1<br />
}<br />
1<br />
k Pr[S k ≥ 0]<br />
(7.13)<br />
and