IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Waiting time problem for an almost perfect match

Listed author(s):
  • Han, Qing
  • Hirano, Katuomi
Registered author(s):

    Given sequences of finite-state trials, an almost perfect match means that there exists at least k-1 matches between any subsequences of size k in each sequence. Let X1,X2,... be a sequence of {0,1}-valued Markov dependent random variables each resulting in either a match (Xi=1) or mismatch (Xi=0) for i=1,2,... . An explicit expression of the probability generating function of the waiting time for the first occurrence of an almost perfect match is derived. Numerical examples are also given.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Elsevier in its journal Statistics & Probability Letters.

    Volume (Year): 65 (2003)
    Issue (Month): 1 (October)
    Pages: 39-49

    in new window

    Handle: RePEc:eee:stapro:v:65:y:2003:i:1:p:39-49
    Contact details of provider: Web page:

    Order Information: Postal:

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    in new window

    1. S. Robin & J.-J. Daudin, 2001. "Exact Distribution of the Distances between Any Occurrences of a Set of Words," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 53(4), pages 895-905, December.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:65:y:2003:i:1:p:39-49. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.