Author： Gang Fang Shemin Zhang Yafei Dong Jin Xu
Publisher： Taylor & Francis Ltd
ISSN： 1002-0071
Source： Progress in Natural Science, Vol.17, Iss.6, 2007-06, pp. : 708-711
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
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-Click 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.
Related content
Solve the partitioning problem by sticker model in DNA computing*
By Qu Huiqin Lu Mingming Zhu Hong
Progress in Natural Science, Vol. 14, Iss. 12, 2004-12 ,pp. :
Access to resources
Recommend
A DNA based model for addition computation *
By Gao Lin Yang Xiao Liu Wenbin Xu Jin
Progress in Natural Science, Vol. 14, Iss. 8, 2004-08 ,pp. :
Autonomous forward inference via DNA computing
By Yan Fu Gen Li Yin Li Dazhi Meng
Progress in Natural Science, Vol. 17, Iss. 6, 2007-06 ,pp. :
A novel R-loop in mouse mitochondrial DNA
By Huang Zhaofeng Zhang Yi Ma Runlin Liu Yinong
Progress in Natural Science, Vol. 13, Iss. 7, 2003-07 ,pp. :
Algebraic characterization of RNA operations for DNA-based computation*
By Li Shuchao
Progress in Natural Science, Vol. 14, Iss. 11, 2004-11 ,pp. :