Waiting time problem for an almost perfect match

Qing Han and Katuomi Hirano

Statistics & Probability Letters, 2003, vol. 65, issue 1, 39-49

Abstract: 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.

Keywords: Waiting; time; problems; Almost; perfect; match; Scan; statistics; DNA; sequence; analysis; Reliability; of; consecutive-k; systems (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0167-7152(03)00217-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:65:y:2003:i:1:p:39-49

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().