Compound poisson and poisson process approximations for occurrences of multiple words in Markov chains

Journal of Computational Biology

Volumn 5, Issue 2, 1998, Pages 223-253

  Reinert, Gesine ^a   Schbath, Sophie ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CEMAGREF   (France)

Author keywords

Chen Stein method; Compound Poisson approximation; Occurrences of multiple words; Poisson process approximation; Stem loop motifs

Indexed keywords

ARTICLE; DNA SEQUENCE; MATHEMATICAL ANALYSIS; MOLECULAR MODEL; PRIORITY JOURNAL; PROBABILITY; STATISTICS;

EID: 0031902984     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1998.5.223     Document Type: Article

References (20)

1. Arratia, R., Goldstein, L., and Gordon, L. 1989. Two moments suffice for Poisson approximations: the Chen-Stein method. Ann. Prob. 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. Barbour, A.D., Chen, L.H.Y., and Loh, W.-L. 1992a. Compound Poisson approximation for nonnegative random variables via Stein's method. Ann. Prob. 20, 1843-1866.
4. Barbour, A.D., Holst, L., and Janson, S. 1992b. Poisson Approximation. Oxford University Press.
5. Barbour, A.D., and Utev, U. 1997. Compound Poisson approximation in total variation. Preprint.
6. Chen, L.H.Y. 1975. Poisson approximation for dependent trials. Ann. Prob. 3, 534-545.
7. Geske, M.X., Godbole, A.P., Schaffner, A.A., Skolnick, A.M., and Wallstrom, G.L. 1995. Compound Poisson approximations for word patterns under Markovian hypotheses. J. Appl. Prob. 32, 877-892.
8. Guibas, L.J., and Odlyzko, A.M. 1981. Periods in strings. J. Combinatorial Theory A 30, 19-42.
9. Karlin, S., and Taylor, H.M. 1975. A first course in stochastic processes. Second ed., Academic Press.
10. Lothaire, M. 1983. Combinatorics on words. Addison-Wesley.
11. Lundstrom, R. 1990. Stochastic models and statistical methods for DNA sequence data. Ph.D. Thesis, Department of Mathematics, University of Utah.
12. Prum, B., Rodolphe, F., and Turckheim, É. De. 1995. Finding words with unexpected frequencies in DNA sequences. J. R. Statist. Soc. B. 57, 205-220.
13. Roos, M. 1994. Stein's method for compound Poisson approximation: The local approach. Ann. Appl. Prob. 4, 1177-1187.
14. Roos, M., and Stark, D. 1998. Compound Poisson approximation of the number of visits to a small set in a Markov chain. Preprint.
15. Schbath, S. 1995a. Compound Poisson approximation of word counts in DNA sequences. ESAIM: Probability and Statistics. 1, 1-16 (http://www.emath.fr/ps/).
16. Schbath, S. 1995b. Ètude asymptotique du nombre d'occurrences d'un mot dans une chaîne de Markov et application à la recherche de mots de frèquence exceptionnelle dans les sèquences d'ADN. PhD Thesis, Université René Descartes, Paris V.
17. Schbath, S., Prum, B., and Turckheim, É. De. 1995. Exceptional motifs in different Markov chain models for a statistical analysis of DNA sequences. J. Comp. Biol. 2, 417-437.
18. Senoussi, R. 1990. Statistique asymptotique presque-sûre de modelès statistiques convexes. Ann. Inst. Henri Poincaré 26, 19-44.
19. Tanushev, M. 1996. Central limit theorem for several patterns in a Markov chain sequence of letters. Preprint.
20. Waterman, M.S. 1995. Introduction to computational biology. Chapman and Hall.