On the distribution of K-tuple matches for sequence homology: A constant time exact calculation of the variance

We study the distribution of a statistic useful in calculating the significance of the number of k-tuple matches detected in biological sequence homology algorithms, The statistic is R-n,R-k, the total number of heads in head runs of length k or more in a sequence of lid Bernoulli trials of length n, Calculation of the mean is straightforward. Poisson approximation formulas have been used for the variance because they are simple and powerful, Unfortunately, when p = P(Head) is large, the Poisson approximation no longer works well, In our application, p is large, say .75, and we have turned instead to direct calculation of the variance, Surprisingly, we are able to show that the variance, which is based on the interactions of O(n(2)) random variables, can be computed in constant time, independent of the length of the sequence and probability p, This result can be used to calculate the mean and variance of a number of other head run statistics in constant time, Additionally, we show how to extend the result to sequences generated by a stationary Markov process where the variance can be calculated in O (n) time.