IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v63y2003i3p267-274.html
   My bibliography  Save this article

On the tail probability of the longest well-matching run

Author

Listed:
  • Chang, C. J.
  • Fann, C. S. J.
  • Chou, W. C.
  • Lian, I. B.

Abstract

The distribution of the length of the longest run has wide applications in regard to reliability and DNA sequencing. Statistical tests based on the longest well-matching run are usually considered to be more reasonable than tests based on the perfect-matching run. In this paper, a method adopted from Fu and Koutras (J. Amer. Statist. Assoc. 89 (1994) 1050) is proposed to improve the efficiency of computing the exact distribution of length. We used the result to investigate the accuracy of some approximations of the distribution.

Suggested Citation

  • Chang, C. J. & Fann, C. S. J. & Chou, W. C. & Lian, I. B., 2003. "On the tail probability of the longest well-matching run," Statistics & Probability Letters, Elsevier, vol. 63(3), pages 267-274, July.
    • Handle: RePEc:eee:stapro:v:63:y:2003:i:3:p:267-274
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(03)00091-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Sotiris Bersimis & Markos V. Koutras & George K. Papadopoulos, 2014. "Waiting Time for an Almost Perfect Run and Applications in Statistical Process Control," Methodology and Computing in Applied Probability, Springer, vol. 16(1), pages 207-222, March.
    2. Han, Qing & Hirano, Katuomi, 2003. "Waiting time problem for an almost perfect match," Statistics & Probability Letters, Elsevier, vol. 65(1), pages 39-49, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:63:y:2003:i:3:p:267-274. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.