1ST AND 2ND MOMENT OF COUNTS OF WORDS IN RANDOM TEXTS GENERATED BY MARKOV-CHAINS

被引：0
|
作者：
KLEFFE, J
BORODOVSKY, M
机构：
[1] GEORGIA INST TECHNOL, SCH BIOL, ATLANTA, GA 30332 USA
[2] MOSCOW MOLEC GENET INST, MOSCOW 123182, USSR
来源：
COMPUTER APPLICATIONS IN THE BIOSCIENCES | 1992年 / 8卷 / 05期
关键词：
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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.
引用
收藏
页码：433 / 441
页数：9
相关论文
共 50 条
12345