Solving Knapsack Problems in a Sticker Based Model

TitleSolving Knapsack Problems in a Sticker Based Model
Publication TypeJournal Papers
Year of Publication2002
AuthorsPérez-Jiménez, M. J., & Sancho-Caparrini F.
Journal TitleLecture Notes in Computer Science
Place PublishedAmsterdam, The Netherlands
Date Published01/2002

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.

ISSN Number0302-9743