First and second moment of counts of words in random texts generated by Markov chains.
An exact expression for the variance of random frequency that a given word has in text generated by a Markov chain is presented. The result is applied to periodic Markov chains, which describe the protein-coding DNA sequences better than simple Markov chains. A new solution to the problem of word overlap is proposed. It was found that the expected frequency and overlapping properties determine most of the variance. The expectation and variance of counts for triplets are compared with experimental counts in Escherichia coli coding sequences.
Kleffe
J
J
Department of Molecular Biology and Informatics, Free University of Berlin, Germany.
Borodovsky
M
M
D000465:Algorithms; D001483:Base Sequence; D008390:Markov Chains; D008958:Models, Molecular; D015233:Models, Statistical; D013269:Stochastic Processes