Paper
Fast Parallel Molecular Solutions for DNA-based Computing: the Subset Product Problem
- Authors:
- Sientang Tsai; Wei-Yeh Chen
- Abstract
- It is shown first by Adleman that deoxyribonucleic acid (DNA) strands 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 Subset Product Problem.
- Keywords
- Biological Computing; Molecular Computing; DNA-based Computing; NP-complete Problems; Subset Product Problem
- StartPage
- 15
- EndPage
- 20
- Doi