References
- A.N. Arapis, F.S. Makri, and Z.M. Psillakis, On the length and the position of the minimum sequence containing all runs of ones in a Markovian binary sequence, Statist. Probab. Lett. 116 (2016), pp. 45–54. doi: 10.1016/j.spl.2016.03.011
- K.E. Atkinson, An Introduction to Numerical Analysis, 2nd ed., John Wiley and Sons, Inc., New York, 1989.
- N. Balakrishnan and M.V. Koutras, Runs and Scans with Applications, Wiley, New York, 2002.
- G. Benson, Tandem repeats finder: A program to analyze DNA sequences, Nucleic Acids Res. 27 (1999), pp. 573–580. doi: 10.1093/nar/27.2.573
- S. Eryilmaz, On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials, Statist. Papers 46 (2005), pp. 117–128. doi: 10.1007/BF02762038
- S. Eryilmaz, Some results associated with the longest run statistic in a sequence of Markov dependent trials, Appl. Math. Comput. 175 (2006), pp. 119–130.
- S. Eryilmaz, Compound Markov negative binomial distribution, J. Comput. Appl. Math. 292 (2016), pp. 1–6. doi: 10.1016/j.cam.2015.06.026
- S. Eryilmaz, The concept of weak exchangeability and its applications, Metrika 80 (2017), pp. 259–271. doi: 10.1007/s00184-016-0602-z
- M.V. Koutras, Applications of Markov chains to the distribution theory of runs and patterns, in Handbook of Statistics 21, D.N. Shanbhag and C.R. Rao, eds., Elsevier, North-Holland, 2003, pp. 431–472.
- M.V. Koutras and V.A. Alexandrou, Nonparametric randomness tests based on success runs of fixed length, Statist. Probab. Lett. 32 (1997), pp. 393–404. doi: 10.1016/S0167-7152(96)00099-5
- F.S. Makri, On occurrences of F-S strings in linearly and circularly ordered binary sequences, J.Appl. Probab. 47 (2010), pp. 157–178. doi: 10.1239/jap/1269610823
- F.S. Makri, A.N. Philippou, and Z.M. Psillakis, Success run statistics defined on an urn model, Adv. Appl. Probab. 39 (2007), pp. 991–1019. doi: 10.1239/aap/1198177236
- F.S. Makri, Z.M. Psillakis, and A.N. Arapis, Length of the minimum sequence containing repeats of success runs, Statist. Probab. Lett. 96 (2015), pp. 28–37. doi: 10.1016/j.spl.2014.09.003
- M.L. Menendez, J.A. Pardo, L. Pardo, and K. Zografos, On tests of independence based on minimum φ-divergence estimator with constraints: An application to modeling DNA, Comput. Statist. Data Anal. 51 (2006), pp. 1100–1118. doi: 10.1016/j.csda.2005.11.006
- A.M. Mood, The distribution theory of runs, Ann. Math. Statist. 11 (1940), pp. 367–392. doi: 10.1214/aoms/1177731825
- G.C. Mytalas and M.A. Zazanis, Central limit theorem approximations for the number of runs in Markov-dependent binary sequences, J. Statist. Plann. Inference 143 (2013), pp. 321–333. doi: 10.1016/j.jspi.2012.07.014
- G.C. Mytalas and M.A. Zazanis, Central limit theorem approximations for the number of runs in Markov-dependent multi-type sequences, Comm. Statist. Theory Methods 43 (2014), pp.1340–1350. doi: 10.1080/03610926.2013.814784
- J. Riordan, An Introduction to Combinatorial Analysis, 2nd ed., John Wiley, New York, 1964.
- K. Sinha and B.P. Sinha, On the distribution of runs of ones in binary strings, Comput. Math. Appl. 58 (2009), pp. 1816–1829. doi: 10.1016/j.camwa.2009.07.057
- N. Wirth, Algorithms & Data Structures, Prentice/Hall International, Inc., London, 1986.