Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This 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
Stable URL: http://www.jstor.org/stable/3215478
Page Count: 6
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
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
Preview not available

Abstract

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 [1] 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 µ.

Page Thumbnails

  • Thumbnail: Page 
601
    601
  • Thumbnail: Page 
602
    602
  • Thumbnail: Page 
603
    603
  • Thumbnail: Page 
604
    604
  • Thumbnail: Page 
605
    605
  • Thumbnail: Page 
606
    606