O. Chrysaphinou, S. Papastavridis, “The occurrence of sequence patterns in repeated dependent experiments”, Teor. Veroyatnost. i Primenen., 35:1 (1990), 167–173; Theory Probab. Appl., 35:1 (1990), 145

Citation in format AMSBIB

\Bibitem{ChrPap90}

\by O.~Chrysaphinou, S.~Papastavridis

\paper The occurrence of sequence patterns in repeated dependent experiments

\jour Teor. Veroyatnost. i Primenen.

\yr 1990

\vol 35

\issue 1

\pages 167--173

\mathnet{http://mi.mathnet.ru/tvp921}

\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1050068}

\zmath{https://zbmath.org/?q=an:0724.60082|0695.60071}

\transl

\jour Theory Probab. Appl.

\yr 1990

\vol 35

\issue 1

\pages 145--152

\crossref{https://doi.org/10.1137/1135015}

\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=A1990FE80900015}

This publication is cited in the following 24 articles:

Danna Zhang, Kai Jin, “Fast Algorithms for Computing the Statistics of Pattern Matching”, IEEE Access, 9 (2021), 114965
Min-zhi Zhao, Dong Xu, Hui-zeng Zhang, “Waiting times and stopping probabilities for patterns in Markov chains”, Appl. Math. J. Chin. Univ., 33:1 (2018), 25
Renato Jacob Gava, Danilo Salotti, “Stopping Probabilities for Patterns in Markov Chains”, Journal of Applied Probability, 51:1 (2014), 287
Valeri T. Stefanov, Scan Statistics, 2009, 351
Pozdnyakov V., “On occurrence of subpattern and method of gambling teams”, Annals of the Institute of Statistical Mathematics, 60:1 (2008), 193–203
Muhittin Mungan, “String Matching and 1d Lattice Gases”, J Stat Phys, 126:1 (2007), 207
Etienne Roquain, Sophie Schbath, “Improved compound Poisson approximation for the number of occurrences of any rare word family in a stationary markov chain”, Advances in Applied Probability, 39:1 (2007), 128
Joseph Glaz, Martin Kulldorff, Vladimir Pozdnyakov, J. Michael Steele, “Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains”, Journal of Applied Probability, 43:1 (2006), 127
Vladimir Pozdnyakov, Martin Kulldorff, “Waiting Times for Patterns and a Method of Gambling Teams”, The American Mathematical Monthly, 113:2 (2006), 134
Vladimir Pozdnyakov, Joseph Glaz, Martin Kulldorff, J. Michael Steele, “A martingale approach to scan statistics”, Ann Inst Stat Math, 57:1 (2005), 21
V. G. Mikhailov, A. M. Shoitov, “Structural equivalence of $s$ -tuples in random discrete sequences”, Discrete Math. Appl., 13:6 (2003), 541–568
Qing Han, Katuomi Hirano, “Sooner and later waiting time problems for patterns in Markov dependent trials”, Journal of Applied Probability, 40:1 (2003), 73
Wiley Series in Probability and Statistics, Runs and Scans with Applications, 2001, 389
S. Robin, J. J. Daudin, “Exact distribution of word occurrences in a random sequence of letters”, Journal of Applied Probability, 36:1 (1999), 179
M. Regnier, W. Szpankowski, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), 1998, 253
Markos V. Koutras, Advances in Combinatorial Methods and Applications to Probability and Statistics, 1997, 363
A. G. Pakes, V. T. Stefanov, “Explicit distributional results in pattern formation”, Ann. Appl. Probab., 7:3 (1997)
S. Aki, N. Balakrishnan, S. G. Mohanty, “Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials”, Ann Inst Stat Math, 48:4 (1996), 773
Dragan Banjevic, “Recursive relations for the distribution of waiting times in a Markov chain”, Journal of Applied Probability, 33:1 (1996), 48
Dragan Banjevic, “Recursive relations for the distribution of waiting times in a Markov chain”, J. Appl. Probab., 33:01 (1996), 48