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.
Publié le : 1990-06-14
Classification:
Moving average,
scan statistics,
sequence matching,
large deviations,
62F05,
92A10
@article{1176347615,
author = {Arratia, R. and Gordon, L. and Waterman, M. S.},
title = {The Erdos-Renyi Law in Distribution, for Coin Tossing and Sequence Matching},
journal = {Ann. Statist.},
volume = {18},
number = {1},
year = {1990},
pages = { 539-570},
language = {en},
url = {http://dml.mathdoc.fr/item/1176347615}
}
Arratia, R.; Gordon, L.; Waterman, M. S. The Erdos-Renyi Law in Distribution, for Coin Tossing and Sequence Matching. Ann. Statist., Tome 18 (1990) no. 1, pp. 539-570. http://gdmltest.u-ga.fr/item/1176347615/