Sooner and later waiting time problems for patterns in Markov dependent trials

Journal of Applied Probability

Volumn 40, Issue 1, 2003, Pages 73-86

  Han, Qing ^a   Hirano, Katuomi ^b  

^a SHANGHAI UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

DNA sequence analysis; Markov chain; Overlapping structure; Pattern; Sooner and later waiting time

Indexed keywords

EID: 0038587359     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1044476828     Document Type: Article

References (24)

1. AKI, S. AND HIRANO, K. (1993). Discrete distributions related to succession events in a two-state Markov chain. Statistical Sciences and Data Analysis (Proc. 3rd Pacific Area Statist. Conf.), eds K. Matusita, M. L. Puri and T. Hayakawa, VSP International Science Publishers, Zeist, pp. 467-474.
2. AKI, S. AND HIRANO, K. (1999). Sooner and later waiting time problems for runs in Markov dependent bivariate trials. Ann. Inst. Statist. Math. 51, 17-29.
3. AKI, S., BALAKRISHNAN, N. AND MOHANTY, S. G. (1996). Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials. Ann. Inst. Statist. Math. 48, 773-787.
4. ANTZOULAKOS, D. L. (1999). On waiting time problems associated with runs in Markov dependent trials. Ann. Inst. Statist. Math. 51, 323-330.
5. ANTZOULAKOS, D. L. AND PHILIPPOU, A. N. (1997). Probability distribution functions of succession quotas in the case of Markov dependent trials. Ann. Inst. Statist. Math. 49, 531-539.
6. BALASUBRAMANIAN, K., VIVEROS, R. AND BALAKRISHNAN, N. (1993). Sooner and later waiting time problems for Markovian Bernoulli trials. Statist. Prob. Lett. 18, 153-161.
7. BLOM, G. AND THORBURN, D. (1982). How many random digits are required until given sequences are obtained? J. Appl. Prob. 19, 518-531.
8. CHADJICONSTANTINIDIS, S., ANTZOULAKOS, D. L. AND KOUTRAS, M. V. (2000). Joint distributions of successes, failures and patterns in enumeration problems. Adv. Appl. Prob. 32, 866-884.
9. CHRYSAPHINOU, O. AND PAPASTAVRIDIS, S. (1990). The occurrence of sequence patterns in repeated dependent experiments. Theory Prob. Appl. 35, 145-152.
10. COWAN, R. (1991). Expected frequencies of DNA patterns using Whittle's formula. J. Appl. Prob. 28, 886-892.
11. FU, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multistate trials. Statist. Sinica 6, 957-974.
12. FU, J. C. AND CHANG, Y. M. (2002). On probability generating functions for waiting time distributions of compound patterns in a sequence of multi state trials. J. Appl. Prob. 39, 70-80.
13. FU, J. C., LOU, W. Y. W. AND CHEN, S. C. (1999). On the probability of pattern matching in nonaligned DNA sequences: a finite Markov chain imbedding approach. Scan Statistics and Applications, eds J. Glaz and N. Balakrishnan, Birkhäuser, Boston, MA, pp. 287-302.
14. HAN, Q. AND AKI, S. (2000a). Sooner and later waiting time problems based on a dependent sequence. Ann. Inst. Statist. Math. 52, 407-414.
15. HAN, Q. AND AKI, S. (2000b). Waiting time problems in a two-state Markov chain. Ann. Inst. Statist. Math. 52, 778-789.
16. KOUTRAS, M. V. (1997). Waiting time distributions associated with runs of fixed length in two-state Markov chains. Ann. Inst. Statist. Math. 49, 123-139.
17. KOUTRAS, M. V. AND ALEXANDROU, V. A. (1997). Sooner waiting time problems in a sequence of trinary trials. J. Appl. Prob. 34, 593-609.
18. LUTKEPOHL, H. (1996). Handbook of Matrices. John Wiley, Chichester.
19. ROBIN, S. AND DAUDIN, J. J. (1999). Exact distribution of word occurrences in a random sequence of letters. J. Appl. Prob. 36, 179-193.
20. ROBIN, S. AND DAUDIN, J. J. (2001). Exact distribution of the distances between any occurrences of a set of words. Ann. Inst. Statist. Math. 53, 895-905.
21. STEFANOV, V. T. (2000). On some waiting time problems. J. Appl. Prob. 37, 756-764.
22. STEFANOV, V. T. AND PAKES, A. G. (1997). Explicit distributional results in pattern formation. Ann. Appl. Prob. 7, 666-678.
23. UCHIDA, M. (1998). On generating functions of waiting time problems for sequence patterns of discrete random variables. Ann. Inst. Statist. Math. 50, 655-671.
24. WATERMAN, M. S. (1995). Introduction to Computational Biology: Maps, Sequences and Genomes. Chapman and Hall, London.