Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
Authors: Gregory Nuel 1
NULL
Gregory Nuel
1 Mathématiques Appliquées Paris 5
In this paper we consider the distribution of a pattern of interest in a binary random (d; k)-sequence generated by a Markov source. Such constrained sequences are frequently encountered in communication systems. Unlike the previous approach based on generating function we have chosen here to use Markov chain embedding techniques. By doing so, we get both previous results (sequence constrained up to the rth occurrence), and new ones (sequence constrained up to its end). We also provide in both cases efficient algorithms using basic linear algebra only. We then compare our numerical results to previous ones and finally propose several interesting extensions of our method which further illustrate the usefulness of our approach. That is to say higher order Markov chains, renewal occurrences rather than overlapping ones, heterogeneous models, more complex patterns of interest, and multistate trial sequences.
Source : ScholeXplorer
IsRelatedTo DOI 10.5772/18448
10.5772/18448
10.5772/18448
Significance Score of Motifs in Biological Sequences
1 Document citing this article
Source : OpenCitations
Nuel, G., 2019, Moments Of The Count Of A Regular Expression In A Heterogeneous Random Sequence, Methodology And Computing In Applied Probability, 21, 3, pp. 875-887, 10.1007/s11009-019-09700-0.