%0 Generic %D 2002 %T Solving Knapsack Problems in a Sticker Based Model %A Mario J. Pérez-Jiménez %A Fernando Sancho-Caparrini %C Amsterdam, The Netherlands %I Springer %P 161-171 %U http://www.springerlink.com/content/qcylexduk2m2pgtp/?p=2fd9a1af78134532a6ef254a6c313bb1&pi=14 %V 2340 %X 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. %8 01/2002