Capítulo de Libro
Solving Knapsack Problems in a Sticker Based Model
Autor/es | Pérez Jiménez, Mario de Jesús
Sancho Caparrini, Fernando |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2002 |
Fecha de depósito | 2016-09-13 |
Publicado en |
|
ISBN/ISSN | 978-3-540-43775-8 0302-9743 |
Resumen | 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 ... 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. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Solving-Knapsack.pdf | 131.9Kb | [PDF] | Ver/ | |