Solving the minimum bisection problem using a biologically inspired computational model

The traditional trend of DNA computing aims at solving computationally intractable problems. The minimum bisection problem (MBP) is a well-known NP-hard problem, which is intended to partition the vertices of a given graph into two equal halves so as to minimize the number of those edges with exactly one end in each half. Based on a biologically inspired computational model, this paper describes a novel algorithm for the minimum bisection problem, which requires a time cost and a DNA strand length that are linearly proportional to the instance size.

[1]  Anne Condon,et al.  Strand design for biomolecular computation , 2002, Theor. Comput. Sci..

[2]  Marek Karpinski,et al.  Approximability of the Minimum Bisection Problem: An Algorithmic Challenge , 2002, MFCS.

[3]  Chung-Wei Yeh,et al.  Molecular solutions to the binary integer programming problem based on DNA computation. , 2006, Bio Systems.

[4]  R. Sharan,et al.  Cluster analysis and its applications to gene expression data. , 2002, Ernst Schering Research Foundation workshop.

[5]  Lloyd M. Smith,et al.  DNA computing on surfaces , 2000, Nature.

[6]  Claire Mathieu,et al.  Error-resilient DNA computation , 1996, SODA '96.

[7]  Martin D. F. Wong,et al.  Efficient network flow based min-cut balanced partitioning , 1994, ICCAD '94.

[8]  R. Shamir,et al.  An algorithm for clustering cDNA fingerprints. , 2000, Genomics.

[9]  Qinghua Liu,et al.  A surface-based approach to DNA computation , 1996, DNA Based Computers.

[10]  Robert Krauthgamer,et al.  A Polylogarithmic Approximation of the Minimum Bisection , 2002, SIAM J. Comput..

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Erik Winfree,et al.  A Sticker-Based Model for DNA Computation , 1998, J. Comput. Biol..

[13]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[14]  Leonard M. Adleman,et al.  Solution of a Satisfiability Problem on a Gel-Based DNA Computer , 2000, DNA Computing.

[15]  Frank Thomson Leighton,et al.  Graph bisection algorithms with good average case behavior , 1984, Comb..

[16]  A. G. Steenbeek,et al.  Finding balanced graph bi-partitions using a hybrid genetic algorithm , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[17]  Minyi Guo,et al.  Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing. , 2005, Bio Systems.

[18]  K Sakamoto,et al.  Molecular computation by DNA hairpin formation. , 2000, Science.

[19]  Andrew B. Kahng,et al.  Can recursive bisection alone produce routable, placements? , 2000, Proceedings 37th Design Automation Conference.

[20]  Dongmei Xiao,et al.  Solving maximum cut problems in the Adleman-Lipton model. , 2005, Bio Systems.

[21]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[22]  Byoung-Tak Zhang,et al.  Solving traveling salesman problems using molecular programming , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[23]  Chung-Kuan Cheng,et al.  A replication cut for two-way partitioning , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[24]  Shi V. Liu.  Debating controversies can enhance creativity , 2000, Nature.

[25]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[26]  Eric Bach,et al.  DNA Models and Algorithms for NP-Complete Problems , 1998, J. Comput. Syst. Sci..

[27]  D. F. Wong,et al.  Efficient network flow based min-cut balanced partitioning , 1994, ICCAD 1994.

[28]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[29]  Chang-Biau Yang,et al.  A DNA solution of SAT problem by a modified sticker model. , 2005, Bio Systems.

[30]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.