DocumentCode
3232440
Title
Constructing molecular parallel subtractor and modular with basic bio-logic operations in the Adleman-Lipton model
Author
Ho, Michael Shan-Hui ; Hung, Kun-Yu ; Chiu, Chaochang
Author_Institution
Comput. Center, Nat. Taipei Univ., San Shia, Taiwan
fYear
2010
fDate
23-26 Sept. 2010
Firstpage
213
Lastpage
218
Abstract
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.
Keywords
biocomputing; computability; computational complexity; molecular biophysics; Adleman-Lipton model; DNA operation; NP-complete Hamiltonian path problem; SAT problem; biologic operation; biomolecular parallel subtractor; biomolecular solution; satisfiability; DNA; Adleman-Lipton model; DNA-based Computing; the NP-Complete Problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2010 IEEE Fifth International Conference on
Conference_Location
Changsha
Print_ISBN
978-1-4244-6437-1
Type
conf
DOI
10.1109/BICTA.2010.5645326
Filename
5645326
Link To Document