@article {187,
	title = {Solving Knapsack Problems in a Sticker Based Model },
	journal = {Lecture Notes in Computer Science},
	volume = {2340},
	year = {2002},
	month = {01/2002},
	pages = {161-171},
	publisher = {Springer},
	address = {Amsterdam, The Netherlands},
	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.
},
	issn = {0302-9743},
	url = {http://www.springerlink.com/content/qcylexduk2m2pgtp/?p=2fd9a1af78134532a6ef254a6c313bb1\&pi=14},
	author = {Mario J. P{\'e}rez-Jim{\'e}nez and Fernando Sancho-Caparrini}
}
