Borodovsky M, McIninch J
School of Biology, Georgia Institute of Technology, Atlanta 30332-0230.
Biosystems. 1993;30(1-3):161-71. doi: 10.1016/0303-2647(93)90068-n.
The search for genes in a newly sequenced DNA is a well known problem. Among other factors, the gene-searching process is hampered by a number of ambiguities which may remain unresolved experimentally for a long time. A computer method that is able to predict genes in a DNA sequence containing ambiguities has been developed, based on the non-homogeneous Markov chain technique. The reliability of the method has been tested using a set of sequences generated by a Monte-Carlo procedure and a set of 425 E. coli sequences with ambiguities introduced artificially.
在新测序的DNA中寻找基因是一个众所周知的问题。除其他因素外，基因搜索过程受到许多模糊性的阻碍，这些模糊性可能在很长一段时间内无法通过实验解决。基于非齐次马尔可夫链技术，开发了一种能够预测含有模糊性的DNA序列中基因的计算机方法。该方法的可靠性已通过一组由蒙特卡罗程序生成的序列和一组人为引入模糊性的425个大肠杆菌序列进行了测试。
