DNA computing of solutions to knapsack problems

One line of DNA computing research focuses on parallel search algorithms, which can be used to solve many optimization problems. DNA in solution can provide an enormous molecular library, which can be searched by molecular biological techniques. We have implemented such a parallel search for solutions to knapsack problems, which ask for the best way to pack a knapsack of limited volume. Several instances of knapsack problems were solved using DNA. We demonstrate how the computations can be extended by in vivo translation of the DNA library into protein. This combination of DNA and protein allows for multi-criterion optimization. The knapsack computations performed can then be seen as protein optimizations, one of the most complex computations performed by natural systems.

[1]  D. Wood,et al.  Computation with biomolecules. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Tom Head.  CIRCULAR SUGGESTIONS FOR DNA COMPUTING , 2000 .

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

[4]  J. Sambrook,et al.  Molecular Cloning: A Laboratory Manual , 2001 .

[5]  Kozo Kinoshita,et al.  Solution of the Knapsack Problem by Deoxyribonucleic Acid Computing , 1998 .

[6]  Joost N. Kok,et al.  Towards Evolutionary DNA Computing , 2005, IWINAC.

[7]  M. Gromov,et al.  Pattern Formation In Biology, Vision And Dynamics , 2000 .

[8]  Monika Sturm,et al.  DNA-Computing – ein funktionales Modell im laborpraktischen Experiment , 2001, Informatik Forschung und Entwicklung.

[9]  Xia Chen,et al.  Aqueous Solutions of Algorithmic Problems: Emphasizing Knights on a 3 x 3 , 2001, DNA.

[10]  Thomas Bäck,et al.  Evolutionary Computation as a Paradigm for DNA-Based Computing , 2002 .

[11]  Vieira Jeffrey,et al.  New pUC-derived cloning vectors with different selectable markers and DNA replication origins. , 1991 .

[12]  Erik Winfree,et al.  Evolution as Computation , 2002, Natural Computing Series.

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

[14]  Mario J. Pérez-Jiménez,et al.  Solving Knapsack Problems in a Sticker Based Model , 2001, DNA.

[15]  Grzegorz Rozenberg,et al.  Protein output for DNA computing , 2004, Natural Computing.

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

[17]  G Rozenberg,et al.  Computing with DNA by operating on plasmids. , 2000, Bio Systems.