Counting Runs of Ones with Overlapping Parts in Binary Strings Ordered Linearly and Circularly

Abstract

On a binary (0 − 1) string of length n the -overlapping counting scheme of runs of 1 s of a fixed length k is considered. According to this scheme, a run of 1s of length k which is counted may have overlapping part of length at most , 0 ≤ < k ≤ n, with the previous run of 1 s of length k that has been enumerated. The numbers of all -overlapping runs of 1 s of length k in all 2 n binary strings (linearly or circularly ordered) of length n are examined, and simple and easy to compute closed explicit expressions are provided via the probability mass function and the expected value of properly defined random variables. The numbers of binary strings of length n, ordered on a line or on a circle, with a specific number of -overlapping runs of 1s of length k are also provided via closed expressions. The numbers which are studied, are potentially useful in several scientific areas like applied probability, engineering and bioinformatics. The study is illustrated by extensive numerical examples.

Joint distribution of k-tuple statistics in zero-one sequences of Markov-dependent trials

“…Current works on the subject include, among others, those of Antzoulakos and Chadjiconstantinidis (2001); Eryilmaz (2006Eryilmaz ( , 2015Eryilmaz ( , 2016Eryilmaz ( , 2017; Eryilmaz and Yalcin (2011);Johnson and Fu (2014); Koutras (2003); Koutras et al (2016); ; Makri et al (2013) and Zazanis (2013, 2014).…”