【摘要】 DNA计算是解决一类难以计算问题的一种新方法,这种计算随着问题的增大可以至指数增长.迄今为止,许多研究成果已经成功地提高了它的性能和增加了它的可行性,本文在基于表面的DNA计算中采用了分子信标编码策略,并对分子信标在与对应的补链杂交形成双键时的受力进行分析,给出3—SAT问题的另一种解法.这种方法比现有的方法更有效,更具发展前景.因为它具有编码简单;耗材底;操作时间短;技术先进等优点.本文尝试了分子生物学,光学和力学的结合.这一工作为DNA计算能解决NP-完全问题提供了更有力的依据.更多还原

【Abstract】 DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size. Up to now, many accomplishments have been achieved to improve its performance and increase its reliability. SAT-problem has been solved by means of molecular beacons techniques in the paper with another method. A simply SAT- problem is encoded in molecules of DNA, and the "operations" of the computation are performed with molecular beacons on the surface. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.更多还原