On the tail probability of the longest well-matching run
β Scribed by C.J. Chang; C.S.J. Fann; W.C. Chou; I.B. Lian
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 198 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
β¦ Synopsis
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 e ciency of computing the exact distribution of length. We used the result to investigate the accuracy of some approximations of the distribution.
π SIMILAR VOLUMES
Let {X a } aβZ be an irreducible and aperiodic Markov chain on a ΓΏnite state space S = {0;