Constructing molecular parallel subtractor and modular with basic bio-logic operations in the Adleman-Lipton model

Adleman proposed a bio-molecular solution to The NP-complete Hamiltonian Path Problem (HPP). No longer is the non solution for any NP problem. Lipton also demonstrated that Adleman's techniques could be used to solve the Satisfiability (SAT) problem. In this paper, we demonstrate how the DNA op...

Full description

Saved in:
Bibliographic Details
Main Authors: Ho, M S.-H, Kun-Yu Hung, Chaochang Chiu
Format: Conference Proceeding
Language:English
Subjects:
Adleman-Lipton model
DNA
DNA-based Computing
the NP-Complete Problem
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Adleman proposed a bio-molecular solution to The NP-complete Hamiltonian Path Problem (HPP). No longer is the non solution for any NP problem. Lipton also demonstrated that Adleman's techniques could be used to solve the Satisfiability (SAT) problem. In this paper, we demonstrate how the DNA operations presented by Adleman and Lipton can be used to construct biomolecular parallel subtractor and modular with basic logic operations in the Adleman-Lipton model.
DOI:10.1109/BICTA.2010.5645326