A DNA-based solution to the graph isomorphism problem using Adleman-Lipton model with stickers

Since the experimental demonstration of its feasibility, DNA-based computing has been applied to a number of decision or combinatorial optimization problems. The graph isomorphism problem belongs to the class of NP problems, and has been conjectured intractable, although probably not NP-complete. In this paper, we demonstrate the power of DNA-based computing by showing the graph isomorphism problem can be efficiently solved under this computation model. By generating the solution space using stickers, we present DNA-based algorithms to solve the problem using polynomial number of basic biological operations.

[1]  Weng-Long Chang,et al.  Fast parallel molecular algorithms for DNA-based computation: factoring integers , 2005, IEEE Transactions on NanoBioscience.

[2]  Minyi Guo,et al.  Solving the Set-Splitting Problem in Sticker-Based Model and the Adleman-Lipton Model , 2003, ISPA.

[3]  Jules Moreau,et al.  Molecular Computation by DNA Hairpin Formation , 2000 .

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

[5]  Minyi Guo,et al.  Towards solution of the set-splitting problem on gel-based DNA computing , 2004, Future Gener. Comput. Syst..

[6]  R. Sinden.  DNA Structure and Function , 1994 .

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

[8]  Ke Chen,et al.  Applied Mathematics and Computation , 2022 .

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

[10]  Minyi Guo,et al.  Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing , 2004, Parallel Comput..

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

[12]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[13]  Susan D. Gillmor,et al.  Computation with DNA on surfaces , 2002 .

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

[15]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[16]  Minyi Guo,et al.  Molecular solutions for the subset-sum problem on DNA-based supercomputing. , 2004, Bio Systems.

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

[18]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

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

[21]  M. Guo,et al.  Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model. , 2003, Bio Systems.