Key points are not available for this paper at this time.
We study approximations to the distribution of counts of matches in the best matching segment of specified length when comparing two long sequences of i.i.d. letters. The key tools used are large-deviation inequalities and the Chen-Stein method of Poisson approximation. The origin of the problem in molecular biology is indicated.
Arratia et al. (Fri,) studied this question.