Poisson Approximation for the Non-Overlapping Appearances of Several Words in Markov Chains

Combinatorics Probability and Computing

Volumn 10, Issue 4, 2001, Pages 293-308

  Chryssaphinou, Ourania ^a   Papastavridis, Stavros ^a   Vaggelatou, Eutichia ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035617531     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S096354830100476X     Document Type: Article

References (30)

1. Arratia, R., Goldstein, L. and Gordon, L. (1989) Two moments suffice for Poisson approximations: The Chen-Stein method. Ann. Probab. 17 9-25.
2. Arratia, R., Goldstein, L., and Gordon, L. (1990) Poisson approximation and the Chen-Stein method. Statistical Science 5 403-434.
3. Arratia, R., Martin, D., Reinert, G. and Waterman, M. (1996) Poisson process approximation for sequence repeats, and sequencing by hybridization. J. Comp. Biology 3 425-463.
4. Barbour, A. D., Hoist, L. and Janson, S. (1992) Poisson Approximation, Oxford University Press.
5. Biggins, J. D. and Cannings, C. (1987) Markov renewal processes, counters and repeated sequences in Markov chains. Adv. Appl. Probab. 19 521-545.
6. Blom, G. and Thorburn, D. (1982) How many random digits are required until given sequences are obtained? J. Appl. Probab. 19 518-531.
7. Breen, S., Waterman, M. S. and Zhang, N. (1985) Renewal theory for several patterns. J. Appl. Probab. 22 228-234.
8. Chen, L. H. Y. (1975) Poisson approximation for dependent trials. Ann. Probab. 3 534-545.
9. Chryssaphinou, O. and Papastavridis, S. (1988) A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials. J. Appl. Probab. 25 428-431.
10. Chryssaphinou, O. and Papastavridis, S. (1990) The occurrence of sequence patterns in repeated dependent experiments. Th. Probab. Appl. 35 145-152.
11. Chryssaphinou, O., Papastavridis, S. and Vaggelatou, E. (1999) On the number of appearances of a word in a sequence of i.i.d. trials. Meth. Comp. Appl. Probab. 1 329-348.
12. Feller, W (1968) An Introduction to Probability Theory and its Applications, Vol I, 3rd edn, Wiley, New York.
13. Fousler, D. E. and Karlin, S. (1987) Maximal success durations for a semi-Markov process. Stock. Proc. Appl. 24 203-224.
14. Fu, J. C. (1996) Distribution theory of runs and patterns associated with a sequence of multi-state trials. Stat. Sinica 6 957-974.
15. Gerber, H. U. and Li, S.-Y. R. (1981) The occurrence of sequence patterns in repeated experiments and hitting tunes in a Markov chain. Stoch. Proc. Appl. 11 101-108.
16. Godbole, A. P. (1991) Poisson approximations for runs and patterns of rare events. Adv. Appl. Probab. 23 851-865.
17. Godbole, A. P. and Schaffner, A. A. (1993) Improved Poisson approximations for word patterns. Adv. Appl. Probab. 25 334-347.
18. Guibas, L. and Odlyzko, A. (1981) Periods in strings. J. Combin. Theory Ser. A 30 19-42.
19. Guibas, L. and Odlyzko, A. (1981) String overlaps, pattern matching, and nontransitive games. J. Combin. Theory Ser. A 30 183-208.
20. Karlin, S. and Ost, F. (1987) Counts of long aligned word matches among random letter sequences. Ann. Probab. 19 293-351.
21. Koutras, M. V. (2000) Applications of Markov chains to the distribution theory of runs and patterns. In Handbook of Statistics (C. R. Rao and D. N. Shanbhag, eds), Vol. 20 of Stochastic Processes: Modelling and Simulation.
22. Lindvall, T. (1992) Lectures on the Coupling Method, Wiley, New York.
23. Neuhauser, C. (1996) A phase transition for the distribution of matching blocks. Combin. Probab. Comput. 5 139-159.
24. Régnier, M. (2000) A unified approach to word occurrence probabilities. D. Appl. Math. 104 259-280.
25. Reinert, G. and Schbath, S. (1998) Compound Poisson and Poisson process approximations for occurrences of multiple words in Markov chains. J. Comp. Biology 5 223-253.
26. Robin, S. and Daudin, J. J. (1999) Exact distribution of word occurrences in a random sequence of letters. J. Appl. Probab. 36 179-193.
27. Schbath, S. (1995) Compound Poisson approximation of word counts in DNA sequences. ESAIM: Probability and Statistics 1 1-16.
28. Schwager, S. J. (1983) Run probabilities in sequences of Markov dependent trials. J. Amer. Statist. Assoc. 78 168-175.
29. Tanushev, M. and Arratia, R. (1997) Central limit theorem for renewal theory for several patterns. J. Comp. Biology 4 35-44.
30. Waterman, M. S. (1995) Introduction to Computational Biology: Maps, Sequences and Genomes, Chapman and Hall, London.