Solving Knapsack Problems in a Sticker Based Model

Authors:
Mario J. Pérez-Jiménez;Fernando Sancho-Caparrini
Affiliations:
-;-
Venue:
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Year:
2001

Citing 1
Cited 6

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Towards solution of the set-splitting problem on gel-based DNA computing

Future Generation Computer Systems - Special issue: Computational chemistry and molecular dynamics
Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing

Parallel Computing - Special issue: High-performance parallel bio-computing
Fast parallel bio-molecular solutions: the set-basis problem

International Journal of Computational Science and Engineering
Using sticker to solve the 3-dimensional matching problem in molecular supercomputers

International Journal of High Performance Computing and Networking
Solving the set-splitting problem in sticker-based model and the lipton-adelmann model

ISPA'03 Proceedings of the 2003 international conference on Parallel and distributed processing and applications
Using sticker model of DNA computing to solve domatic partition, kernel and induced path problems

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.