A DNA-based graph encoding scheme with its applications to graph isomorphism problems

Abstract Feynman first proposed DNA-based computation in 1961, but his idea was not implemented by experiment for a few decades. By properly manipulating DNA strands as the input instance of the Hamiltonian path problem, Adleman succeeded in solving the problem in a test tube. Since the experimental demonstration of its feasibility, DNA-based computing has been applied to a number of decision or combinatorial optimization problems. In this paper, we propose a DNA-based graph encoding scheme which can be used to solve some intractable graph problems, such as the subgraph isomorphism problem and its generalized problem – the maximum common subgraph problem, which are known to be NP-complete problems, in the Adleman–Lipton model using polynomial number of basic biological operations.

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

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

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

[4]  Minyi Guo,et al.  Using sticker to solve the 3-dimensional matching problem in molecular supercomputers , 2004, Int. J. High Perform. Comput. Netw..

[5]  Minyi Guo,et al.  Fast Parallel Solution for Set-Packing and Clique Problems by DNA-Based Computing , 2004, IEICE Trans. Inf. Syst..

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

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

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

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

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

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

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

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

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

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

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

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

[18]  Weng-Long Chang.  Fast Parallel DNA-Based Algorithms for Molecular Computation: The Set-Partition Problem , 2007, IEEE Transactions on NanoBioscience.

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

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

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

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