Solving knapsack problems in a sticker based model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2340, Issue , 2002, Pages 161-171

  Pérez Jiménez, Mario J ^a   Sancho Caparrini, Fernando ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

COMPLETE PROBLEMS; DNA COMPUTATION; FINITE SET; INDUCTIVE TECHNIQUE; KNAPSACK PROBLEMS; MOLECULAR SOLUTIONS; SUBSET SUM; TEST TUBE;

DNA;

EID: 70349991366     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48017-x_15     Document Type: Conference Paper

References (3)

1. Adleman, L. On constructing a molecular computer, in DNA based computers, R.J. Lipton and E.B. Baum, eds., American Mathematical Society, 1996, 1–22.
2. Garey M.R.; Johnson D.S. Computers and intractability, W.H. Freeman and Company, New York, 1979.
3. Roweis, S.; Winfree, E.; Burgoyne, R.; Chelyapov, N.; Goodman, M; Rothemund, P. and Adleman, L. A Sticker–Based Model for DNA Computation, J. Comp. Biol. 5, 615–629, 1998