The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: An algorithmic approach

Journal of Applied Probability

Volumn 40, Issue 4, 2003, Pages 881-892

  Stefanov, Valeri T ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Pattern; Probability generating function; Random sum; Semi Markov process

Indexed keywords

EID: 0442323012     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1067436088     Document Type: Article

References (21)

1. ANTZOULAKOS, D. L. (2001). Waiting times for patterns in a sequence of multistate trials. J. Appl. Prob. 38, 508-518.
2. BALAKRISHNAN, N. AND KOUTRAS, M. (2002). Runs and Scans with Applications. John Wiley, New York.
3. BIGGINS, J. D. (1987). A note on repeated sequences in Markov chains. Adv. Appl. Prob. 19, 739-742.
4. BIGGINS, J. D. AND CANNINGS, C. (1987). Markov renewal processes, counters and repeated sequences in Markov chains. Adv. Appl. Prob. 19, 521-545.
5. BLOM, G. AND THORBURN, D. (1982). How many random digits are required until given sequences are obtained? J. Appl. Prob. 19, 518-531.
6. 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.
7. CHRYSSAPHINOU, O. AND PAPASTAVRIDIS, S. (1990). The occurrence of a sequence of patterns in repeated dependent experiments. Theory Prob. Appl. 35, 167-173.
8. ÇINLAR, E. (1975). Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs, NJ.
9. FELLER, W. (1950). An Introduction to Probability Theory and Its Applications, Vol. 1. John Wiley, New York.
10. Fu, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multistate trials. Statistics Sinica 6, 957-974.
11. Fu, J. C. AND CHANG, Y. M. (2002). On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials. J. Appl. Prob. 39, 70-80.
12. GERBER, H. AND LI, S.-Y. R. (1981). The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain. Stoch. Process. Appl. 11, 101-108.
13. GUIBAS, L. J. AND ODLYZKO, A. M. (1981). String overlaps, pattern matching, and nontransitive games. J. Combinatorial Theory A 30, 183-208.
14. KIJIMA, M. (1997). Markov Processes for Stochastic Modelling. Chapman and Hall, London.
15. LI, S.-Y. R. (1980). A martingale approach to the study of occurrence of sequence patterns in repeated experiments. Ann. Prob. 8, 1171-1176.
16. REINERT, G., SCHBATH, S. AND WATERMAN, M. (2000). Probabilistic and statistical properties of words: an overview. J. Comput. Biol. 7, 1-46.
17. ROBIN, S. AND DAUDIN, J. (1999). Exact distribution of word occurrences in a random sequence of letters. J. Appl. Prob. 36, 179-193.
18. STEFANOV, V. T. (2000). On some waiting time problems. J. Appl. Prob. 37, 756-764.
19. STEFANOV, V. T. AND PAKES, A. G. (1997). Explicit distributional results in pattern formation. Ann. Appl. Prob. 7, 666-678.
20. SYSKI, R. (1992). Passage Times for Markov Chains. IOS Press, Amsterdam.
21. SZPANKOWSKI, W. (2001). Average Case Analysis of Algorithms on Sequences. John Wiley, New York.