A LIMIT THEOREM FOR MATCHING RANDOM SEQUENCES ALLOWING DELETIONS
成果类型：
Article
署名作者：
Zhang, Yu
署名单位：
University of Colorado System; University of Colorado at Colorado Springs
刊物名称：
ANNALS OF APPLIED PROBABILITY
ISSN/ISSBN：
1050-5164
DOI：
10.1214/aoap/1177004613
发表日期：
1995
页码：
1236-1240
关键词：
摘要：
We consider a sequence matching problem involving the optimal alignment score for contiguous sequences, rewarding matches by one unit and penalizing for deletions and mismatches by parameters delta and mu, respectively. Let M-n be the optimal score over all possible choices of two contiguous regions. Arratia and Waterman conjectured that, when the score constant a(mu, delta) < 0, P(M-n/log n -> 2b) = 1 for some constant b. Here we prove the conjecture affirmatively.
来源URL：