Pérez Jiménez, Mario de JesúsSancho Caparrini, Fernando2016-09-132016-09-132002978-3-540-43775-80302-9743http://hdl.handle.net/11441/44930Our 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.application/pdfengAttribution-NonCommercial-NoDerivatives 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/bookPartinfo:eu-repo/semantics/openAccesshttps://doi.org/10.1007/3-540-48017-X_15