Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem

Authors:
Sientang Tsai
Affiliations:
Department of Information Management, Southern Taiwan University, Yuan Kung city, Tainan county, Taiwan, R.O.C.
Venue:
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Year:
2009

Citing 5
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Solution of a Satisfiability Problem on a Gel-Based DNA Computer

DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
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
Theoretical and Experimental DNA Computation (Natural Computing Series)

Theoretical and Experimental DNA Computation (Natural Computing Series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown first by Adleman that deoxyribonucleic acid (DNA) strand could be employed towards calculating solution to an instance of the NP-complete Hamiltonian Path Problem (HPP). Lipton also demonstrated that Adleman's techniques could be used to solve the satisfiability (SAT) problem. In this paper, it is demonstrated how the DNA operations presented by Adleman and Lipton can be used to develop the DNA-based algorithm for solving the 0-1 Knapsack Problem.