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

作　　者：Fang Gang Zhang Shemin Dong Yafei Xu Jin 

机构地区：[1]The Key Laboratory of Image Processing and Intelligent Control, Department of Control Science ＆ Engineering, Huazhong Universi-ty of Science and Technology, Wuhan 430074, China [2]Shaanxi University of Technology, Hanzhong 723000, China

出　　处：《Progress in Natural Science:Materials International》2007年第6期708-711,共4页自然科学进展·国际材料（英文版）

基　　金：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)

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

关 键 词：DNA computing 3-vertex-colorability problem 

分 类 号：TP384[自动化与计算机技术—计算机系统结构]