Solving the Maximum Independent Set Problem based on Molecule Parallel Supercomputing

The maximum independent set Problem is to find a biggest verte x independent set in a given undirected graph. It is a vitally important NP problem in graph theory and applied mathematics, having numerous real life applications. It can be difficul tly solved by the electronic computer in exponential level time. Simultaneity in previous studies DNA molecular computation usually be used to solve NP-complete continuous path search problems (for example HPP, traveling salesman problem), rarely for NP problems with discrete vertex or path solutions result, such as the maximum independent set problem, graph coloring problem and so on. In this paper, we present a new algorithm for solving the maximum independent set problem with DNA molecular operations. For an undirected graph with n vertices, We reasonably design fixed length DNA strands repr esenting the vertices and edges of graph, take appropriate steps and get the solutions of the problem in proper length range using O(n 2 ) time. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation.

[1]  Jiang Yu,et al.  Procedures for a dynamical system on {0,1}n with DNA molecules. , 2006, Bio Systems.

[2]  Ken-ichi Matsumoto,et al.  Procedures For Logic And Arithmetic Operations With Dna Molecules , 2004, Int. J. Found. Comput. Sci..

[3]  Yufang Jin,et al.  Mathematical modeling of left ventricular dimensional changes in mice during aging , 2012, BMC Systems Biology.

[4]  F Guarnieri,et al.  Maya Blue Paint: An Ancient Nanostructured Material , 1996, Science.

[5]  Rainer Schuler,et al.  DNA-based Parallel Computation of Simple Arithmetic , 2001, DNA.

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

[7]  Dafa Li,et al.  Hairpin formation in DNA computation presents limits for large NP-complete problems. , 2003, Bio Systems.

[8]  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).

[9]  Akihiro Fujiwara,et al.  Procedures for Computing the Maximum with DNA Strands , 2003, PDPTA.

[10]  Yiming Zhang,et al.  Solving traveling salesman problem in the Adleman-Lipton model , 2012, Appl. Math. Comput..

[11]  Lin He,et al.  DNA ternary addition , 2006, Appl. Math. Comput..

[12]  Byoung-Tak Zhang,et al.  Solving traveling salesman problems with DNA molecules encoding numerical values. , 2004, Bio Systems.

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

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

[15]  Laura F. Landweber,et al.  The past, present and future of molecular computing , 2000, Nature Reviews Molecular Cell Biology.

[16]  Zhaocai Wang,et al.  A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation , 2013, Biosyst..

[17]  Yufang Jin,et al.  A conceptual cellular interaction model of left ventricular remodelling post-MI: dynamic network with exit-entry competition strategy , 2010, BMC Systems Biology.

[18]  Xiaolong Wang,et al.  Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction , 2008, Biosyst..

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

[20]  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.

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

[22]  Liu Si-feng,et al.  Research on Consistency and Priority of Interval Number Complementary Judgment Matrix , 2006 .

[23]  David I. Lewin,et al.  DNA computing , 2002, Comput. Sci. Eng..

[24]  Masahito Yamamoto,et al.  Solutions of Shortest Path Problems by Concentration Control , 2001, DNA.