You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Inequalities for the Score Constant in Matching Random Sequences
Yunshyong Chow and Yu Zhang
Journal of Applied Probability
Vol. 36, No. 2 (Jun., 1999), pp. 601-606
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/3215478
Page Count: 6
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We consider a sequence matching problem involving the optimal alignment score for contiguous sequences; rewarding matches and penalizing for deletions and mismatches. Arratia and Waterman conjectured in  that the score constant a(µ,δ) is a strictly monotone function (i) in δ for all positive δ and (ii) in µ if 0≤µ≤2δ. Here we prove that (i) is true for all δ and (ii) is true for some µ.
Journal of Applied Probability © 1999 Applied Probability Trust