Solving Knapsack Problems in a Sticker Based Model

Fri, 11/30/2007 - 13:10 — ana

Title	Solving Knapsack Problems in a Sticker Based Model
Publication Type	Journal Papers
Year of Publication	2002
Authors	Pérez-Jiménez, M. J., & Sancho-Caparrini F.
Journal Title	Lecture Notes in Computer Science
Publisher	Springer
Place Published	Amsterdam, The Netherlands
Volume	2340
Pages	161-171
Date Published	01/2002
Abstract	Our main goal in this paper is to give molecular solutions for two NP-complete problems, namely Subset-sum and Knapsack, in a sticker based model for DNA computations. In order to achieve this, we have used a finite set sorting subroutine together with the description of a procedure to formally verify the designed programs through the labeling of test tubes using inductive techniques.
URL	http://www.springerlink.com/content/qcylexduk2m2pgtp/?p=2fd9a1af78134532a6ef254a6c313bb1&pi=14
ISSN Number	0302-9743