Solving maximum cut problems in the Adleman-Lipton model.
In this paper, we consider a procedure for solving maximum cut problems in the Adleman-Lipton model. The procedure works in O(n2) steps for maximum cut problems of an undirected graph with n vertices.
Xiao
Dongmei
D
Bio-X DNA Computer Consortium, Shanghai Jiao Tong University, Shanghai 200030, PR China.
Li
Wenxia
W
Zhang
Zhizhou
Z
He
Lin
L
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D004247:DNA / Q000737:chemistry; D008954:Models, Biological; D008962:Models, Theoretical; D011108:Polymers / Q000737:chemistry; D012984:Software; D049490:Systems Biology / Q000379:methods*
D011108:Polymers; D004247:DNA