Repositorio de producción científica de la Universidad de Sevilla

Solving Knapsack Problems in a Sticker Based Model

 

Advanced Search
 
Opened Access Solving Knapsack Problems in a Sticker Based Model
Cites

Show item statistics
Icon
Export to
Author: Pérez Jiménez, Mario de Jesús
Sancho Caparrini, Fernando
Department: Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Date: 2002
Published in: DNA Computing. Lecture Notes in Computer Science ; Vol. 2340
ISBN/ISSN: 978-3-540-43775-8
0302-9743
Document type: Chapter of Book
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.
Size: 131.9Kb
Format: PDF

URI: http://hdl.handle.net/11441/44930

DOI: 10.1007/3-540-48017-X_15

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)