A novel DNA computing model based on RecA-mediated triple-stranded DNA structure

作     者：Fang Gang1, Zhang Shemin2, Dong Yafei1 and Xu Jin1(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) 

作者机构：[a]The Key Laboratory of Image Processing and Intelligent Control Department of Control Science & Engineering Huazhong University of Science and Technology Wuhan China [b]Shaanxi University of Technology Hanzhong China 

出 版 物：《Progress in Natural Science:Materials International》 (自然科学进展·国际材料(英文))

年 卷 期：2007年第17卷第6期

页      面：708-711页

核心收录：

学科分类：0710[理学-生物学] 071010[理学-生物化学与分子生物学] 081704[工学-应用化学] 07[理学] 08[工学] 0817[工学-化学工程与技术] 

基　　金：Supported by National Natural Science Foundation of China (Grant Nos 60533010 ,60373089 ,60674106) Science Foundation of Shaanxi Bu-reau of Education (Grant No 06JK202) Programfor New Century Excellent Talentsin University (No NCET-05-0612) the PhDProgramsFoundation of Ministry of Education of China (No 20060487014) 

主　　题：DNA computing 3-vertex-colorability problem. 

摘      要：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.