Authors: Gang Fang Jin Xu Shemin Zhang
Publish Date: 2007/09/13
Volume: 8, Issue: 1, Pages: 149-156
Abstract
A new method of DNA computing using an unusual triplestranded DNA structure mediated by RecA protein is introduced and a minor 3variable instance of the satisfiability SAT problem is solved Separations were performed by using biotinylated oligodeoxynucleotide probes coated with RecA protein During the computation sequencespecific recognition of doublestranded DNA by homologous oligodeoxynucleotides was fulfilled in the presence of ATPĪ³S Captured by the magnetic particles coated with streptavidin the desirable doublestranded 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 problemsThe project is partially supported by National Science Foundation of China Grant number 60533010 30570431 and Foundation of Shaanxi Provincial Bureau of Education Grant number 06JK202 We acknowledge the financial support of Dalian University And we gratefully acknowledge the kind help and valuable suggestions from Xiaohui Liu and Xiaodong Yuan of TaKaRa Biotechnology Dalian Co Ltd Finally the authors wish to thank the anonymous referees of this paper who provided many useful and constructive suggestions for the improvement of this paper
Keywords: