Chapter of Book
Solving Knapsack Problems in a Sticker Based Model
| Author/s | 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 |
| Publication Date | 2002 |
| Deposit Date | 2016-09-13 |
| Published in |
|
| ISBN/ISSN | 978-3-540-43775-8 0302-9743 |
| 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 ... |
: 
| Files | Size | Format | View | Description |
|---|---|---|---|---|
| Solving-Knapsack.pdf | 131.9Kb | 
[PDF]
| View/ | |
http://hdl.handle.net/11441/44930
https://doi.org/10.1007/3-540-48017-X_15This item appears in the following collection(s)
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional