Solving maximum cut problems in the Adleman-Lipton model

Dongmei Xiao; Wenxia Li; Zhizhou Zhang; Lin He

doi:10.1016/j.biosystems.2005.06.009

Solving maximum cut problems in the Adleman-Lipton model

Biosystems. 2005 Dec;82(3):203-7. doi: 10.1016/j.biosystems.2005.06.009. Epub 2005 Oct 19.

Authors

Dongmei Xiao¹, Wenxia Li, Zhizhou Zhang, Lin He

Affiliation

¹ Bio-X DNA Computer Consortium, Shanghai Jiao Tong University, Shanghai 200030, PR China.

PMID: 16236426
DOI: 10.1016/j.biosystems.2005.06.009

Abstract

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.

Publication types

Research Support, Non-U.S. Gov't

MeSH terms

Algorithms
Computational Biology / methods*
DNA / chemistry
Models, Biological
Models, Theoretical
Polymers / chemistry
Software
Systems Biology / methods*

Substances

Polymers
DNA