用于DNA编码的部分字  

Partial words for DNA encoding

作　　者：李珍[1] 王淑栋[1] 李二艳[1] 

机构地区：[1]山东科技大学信息科学与工程学院,山东青岛266510

出　　处：《智能系统学报》2011年第2期185-188,共4页CAAI Transactions on Intelligent Systems

基　　金：国家自然科学基金资助项目(60503002);中国博士后科学基金资助项目(20060400344)

摘　　要：寻找合理的DNA编码是DNA计算中一个基本的问题.因此要给出一种方法使得DNA序列不会产生不想要的结构,尤其是假阳性是解决此问题的关键.传统方法是要求码字间的Hamming距离足够大.因此考虑用部分字的方法来解决DNA编码问题,利用部分字的洞的定义及其性质得到了关于部分字的洞、Hamming距离和Watson-CrickHamming距离的3个命题,通过部分字对DNA编码进行了优化,解决了DNA编码中的部分疑难问题.Finding a good DNA code is a very basic problem in DNA computation.A solution must be provided which ensures that the strands involved do not exhibit any undesired behavior,and especially that they should not form a false positive.The traditional solution requires the Hamming distance between the words to be big enough.The author proposed the idea of considering only partial words for the solution of the DNA encoding problem.To some degree they already include the Hamming distance in the definition of compatibility.Thus,they can be used to simultaneously guarantee a desired distance and other properties.In this paper,the definition of Hole and some properties of partial words were applied to achieve three propositions concerning Hole,Hamming distance,and Watson-Crick Hamming distance.The DNA code set was optimized by using the partial words.Thus some difficult problems were resolved in DNA encoding.

关 键 词：DNA编码 部分字 洞 HAMMING距离 WATSON-CRICK HAMMING距离 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]