Solving 0-1 planning problem based on self-assembly of dna tiles | |
Huang, Yufang ; Cheng, Zhen ; Xu, Jin ; Shi, Xiaolong ; Zhou, Kang | |
2010 | |
英文摘要 | DNA tile self-assembly has been proved to enable programmable manipulation of biological systems as a tool of molecular computation. It is mainly based on the property that is the spontaneous self-ordering of substructure into superstructure driven by annealing of Watson-Crick base-pairing DNA sequences. We take full advantage of the superiority of DNA tile self-assembly to construct a molecular computing system that implements a solution for the 0-1 planning problem. This algorithm can independently and simultaneously yield the data pool, containing all possible solutions when all basic operation tiles are designed beforehand. Then we can use some advanced bio-chemistry techniques to select the optimization solutions of the 0-1 planning problem. Our work has shown that it is possible to work with an exponential number of components to solve NP-complete problems. The method proposed here also can reduce the number of laboratory steps required for computation so that it can improve the computation speed. Copyright ? 2010 American Scientific Publishers. All rights reserved.; EI; 5; 826-830; 7 |
语种 | 英语 |
DOI标识 | 10.1166/jctn.2010.1427 |
内容类型 | 其他 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/461801] |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Huang, Yufang,Cheng, Zhen,Xu, Jin,et al. Solving 0-1 planning problem based on self-assembly of dna tiles. 2010-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论