2 problems

Let $Z$ be the number of occurrences of a pattern $w$ as a subsequence in a random text of length $n$, and let $\binom{n}{m}$ be the number of possible positions for a subsequence…

Let $w$ be a pattern and let $Z$ denote its number of subsequence occurrences in a random text. For constant patterns, the limiting distribution is either asymptotically normal or…