首页 | 本学科首页   官方微博 | 高级检索  
     


Performing DNA computation with RecA-mediated triple-stranded DNA structure
Authors:Gang Fang  Jin Xu  Shemin Zhang
Affiliation:(1) Department of Control Science and Engineering, Huazhong University of Science and Technology, Wuhan, Hubei, 430074, China;(2) Department of Bioengineering, Dalian University, Dalian, Liaoning, 116622, China;(3) Xi’an International Studies University, Xi’an, Shaanxi, 710061, China
Abstract:A new method of DNA computing using an unusual triple-stranded DNA structure mediated by RecA protein is introduced and a minor 3-variable instance of the satisfiability (SAT) problem is solved. Separations were performed by using biotinylated oligodeoxynucleotide probes coated with RecA protein. During the computation, sequence-specific recognition of double-stranded DNA by homologous oligodeoxynucleotides was fulfilled in the presence of ATPγS. Captured by the magnetic particles coated with streptavidin, the desirable double-stranded DNA strands were retained and extracted. It is suggested that the methods employed here may help decrease the errors in DNA computation and solve some larger size NP- complete problems.
Keywords:DNA computing  NP-complete problems  RecA protein  Satisfiability problem (SAT)  Triple-stranded DNA structure
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号