Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem

It is shown first by Adleman that deoxyribonucleic acid (DNA) strand could be employed towards calculating solution to an instance of the NP-complete Hamiltonian Path Problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to solve the satisfiability (SAT) problem. In this paper, it is demonstrated how the DNA operations presented by Adleman and Lipton can be used to develop the DNA-based algorithm for solving the 0-1 Knapsack Problem.

[1]  Michael Shan-Hui Ho.  Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem. , 2005, Bio Systems.

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

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

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

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

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

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

[8]  Erik Winfree,et al.  On applying molecular computation to the data encryption standard , 1999, DNA Based Computers.

[9]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.

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

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

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

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

[14]  Martyn Amos,et al.  Theoretical and Experimental DNA Computation , 1999, Bull. EATCS.

[15]  A. Emery,et al.  Recombinant DNA, 2nd edn. J. D. Watson, M. Gilman, J. Witkowski and M. Zoller. Published 1992 by Freeman, Oxford. ISBN 0 7167 1994 0 (hardback), 0 7167 2282 6 (paperback), 626 pp. Price ♠35.95 (hardback), ♠21.95 (paperback) , 1992, Neuromuscular Disorders.

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

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

[18]  Richard J. Lipton,et al.  Breaking DES using a molecular computer , 1995, DNA Based Computers.

[19]  Martyn Amos,et al.  Theoretical and Experimental DNA Computation (Natural Computing Series) , 2005 .

[20]  G. Michael Blackburn,et al.  Nucleic acids in chemistry and biology , 2007 .

[21]  Jeffrey W. Roberts,et al.  遺伝子の分子生物学 = Molecular biology of the gene , 1970 .

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

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