计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (14): 24-26.

• 博士论坛 • 上一篇    下一篇

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

张 凯,肖建华,耿修堂,邵泽辉   

  1. 华中科技大学 控制科学与工程系,武汉 430074
  • 收稿日期:2007-12-29 修回日期:2008-02-03 出版日期:2008-05-11 发布日期:2008-05-11
  • 通讯作者: 张 凯

Research on DNA encoding constraints based on Hamming distance

ZHANG Kai,XIAO Jian-hua,GENG Xiu-tang,SHAO Ze-hui   

  1. Department of Control Science and Engineering,Huazhong University of Science and Technology,Wuhan 430074,China
  • Received:2007-12-29 Revised:2008-02-03 Online:2008-05-11 Published:2008-05-11
  • Contact: ZHANG Kai

摘要: DNA计算是将现实问题进行编码映射到DNA分子上,通过生物实验产生出代表问题的解的DNA分子,最后通过检测技术提取出该DNA分子。高质量的DNA编码可以尽可能避免或减少计算过程中出现的错误,并使检测阶段易于提取出代表问题的解的DNA分子。对DNA编码约束进行了研究,分析了基于汉明距离的编码约束可以有效降低DNA分子间相似程度,减少DNA计算过程中DNA分子间的相互干扰,从而提高DNA计算的有效性和可靠性。还证明了基于汉明距离的编码约束存在等价的序列组合,降低了编码计算的复杂度。

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

Abstract: 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.

Key words: DNA computing, DNA sequences design, Hamming distance, specific hybridization