基于汉明距离的DNA编码约束研究  

Research on DNA encoding constraints based on Hamming distance

作　　者：张凯[1] 肖建华[1] 耿修堂[1] 邵泽辉[1] 

机构地区：[1]华中科技大学控制科学与工程系,武汉430074

出　　处：《计算机工程与应用》2008年第14期24-26,共3页Computer Engineering and Applications

基　　金：国家自然科学基金重点;面上资助项目(the National Natural Science Foundation of China No.60533010;No.30670540);国家高技术研究发展计划(863)(the National High-Tech Research and Development Plan of China under Grant No.2006AA01Z104)

摘　　要：DNA计算是将现实问题进行编码映射到DNA分子上,通过生物实验产生出代表问题的解的DNA分子,最后通过检测技术提取出该DNA分子。高质量的DNA编码可以尽可能避免或减少计算过程中出现的错误,并使检测阶段易于提取出代表问题的解的DNA分子。对DNA编码约束进行了研究,分析了基于汉明距离的编码约束可以有效降低DNA分子间相似程度,减少DNA计算过程中DNA分子间的相互干扰,从而提高DNA计算的有效性和可靠性。还证明了基于汉明距离的编码约束存在等价的序列组合,降低了编码计算的复杂度。DNA computing maps the instances of a reality problem onto specific DNA molecules and protocols so that the result contains the answers to the problem＇ s instances to enable successful extraction. Good DNA sequences prevents unwanted hybridization errors during the computation and enable easy retrieval the answers in the extraction phase. The paper illustrates that the Hamming based constraints can reduce the dissimilar degree of DNA molecules,prevents the interference between different DNA molecules, and improves the reliability and effectiveness of DNA computation.

关 键 词：DNA计算 DNA编码设计 汉明距离 特异性杂交 

分 类 号：TP384[自动化与计算机技术—计算机系统结构]