| 基于DNA计算的Hamilton图 |
| |
| 作者姓名： | ZHANG Jia-xiu |
| |
| 作者单位： | ZHANG Jia-xiu
Department of Mathematics and Physics,Anhui University of Science and Technology,Huainan 232001,China |
| |
| 基金项目： | Supported by the CNSF(60274026,60174047,30370356),Supported by the Anhui Provinc'e Educational Committee Foundation(2003Kj098) |
| |
| 摘 要： | DNA computing is a novel method for solving a class of intractable computationalproblems in which the computing can grow exponentially with problem size. Up to now, manyaccomplishments have been achieved to improve its performance and increase its reliability.Hamilton Graph Problem has been solved by means of molecular biology techniques. A smallgraph was encoded in molecules of DNA, and the “operations” of the computation wereperformed with standard protocols and enzymes. This work represents further evidence forthe ability of DNA computing to solve NP-complete search problems.
|
| 关 键 词： | 图论 脱氧核糖核酸 曲线图 解决方法 生物技术 编码 |
Hamilton Graph Based on DNA Computing |
| |
| ZHANG Jia-xiu.Hamilton Graph Based on DNA Computing[J].Chinese Quarterly Journal of Mathematics,2004,19(1):79-83. |
| |
| Authors: | ZHANGJia-xiu |
| |
| Institution: | DepartmentofMathematicsandPhysics,AnhuiUniversityofScienceandTechnology,Huainan232001,China |
| |
| 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. Hamilton Graph Problem has been solved by means of molecular biology techniques. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems. |
| |
| Keywords: | Hamilton Graph DNA computing NP-complete |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
