| A novel DNA computing model based on RecA-mediated triple-stranded DNA structure |
| |
| 作者姓名： | Fang Gang Zhang Shemin Dong Yafei and Xu Jin |
| |
| 基金项目： | 国家自然科学基金;教育部高校新世纪杰出人才项目;高等学校博士学科点专项科研项目 |
| |
| 摘 要： | The field of DNA computing emerged in 1994 after Adleman’s paper was published. Henceforth,a few scholars solved some noted NP-complete problems in this way. And all these methods of DNA computing are based on conventional Watson-Crick hydrogen bond of doublehelical DNA molecule. In this paper, we show that the triple-stranded DNA structure mediated by RecA protein can be used for solving computational problems. Sequence-specific recognition of double-stranded DNA by oligonucleotide-directed triple helix (triplex) formation is used to carry out the algorithm. We present procedure for the 3-vertex-colorability problems. In our proposed procedure, it is suggested that it is possible to solve more complicated problems with more variables by this model.
|
A novel DNA computing model based on RecA-mediated triple-stranded DNA structure |
| |
| Fang Gang,Zhang Shemin,Dong Yafei and Xu Jin.A novel DNA computing model based on RecA-mediated triple-stranded DNA structure[J].Progress in Natural Science,2007,17(6):708-711. |
| |
| Authors: | Fang Gang Zhang Shemin Dong Yafei and Xu Jin |
| |
| Institution: | 1. The Key Laboratory of Image Processing and Intelligent Control, Department of Control Science & Engineering, Huazhong University of Science and Technology, Wuhan 430074, China; 2. Shaanxi University of Technology, Hanzhong 723000, China |
| |
| Abstract: | The field of DNA computing emerged in 1994 after Adleman's paper was published. Henceforth, a few scholars solved some noted NP-complete problems in this way. And all these methods of DNA computing are based on conventional Watson-Crick hydrogen bond of doublehelical DNA molecule. In this paper, we show that the triple-stranded DNA structure mediated by RecA protein can be used for solving computational problems. Sequence-specific recognition of double-stranded DNA by oligonucleotide-directed triple helix (triplex) formation is used to carry out the algorithm. We present procedure for the 3-vertex-colorability problems. In our proposed procedure, it is suggested that it is possible to solve more complicated problems with more variables by this model. |
| |
| Keywords: | DNA computing 3-vertex-colorability problem |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《自然科学进展(英文版)》浏览原始摘要信息 |
| 点击此处可从《自然科学进展(英文版)》下载免费的PDF全文 |
