DocumentCode
981766
Title
Fast Parallel DNA-Based Algorithms for Molecular Computation: The Set-Partition Problem
Author
Chang, Weng-Long
Author_Institution
Nat. Kaohsiung Univ. of Appl. Sci., Kaohsiung
Volume
6
Issue
4
fYear
2007
Firstpage
346
Lastpage
353
Abstract
This paper demonstrates that basic biological operations can be used to solve the set-partition problem. In order to achieve this, we propose three DNA-based algorithms, a signed parallel adder, a signed parallel subtractor and a signed parallel comparator, that formally verify our designed molecular solutions for solving the set-partition problem.
Keywords
biocomputing; computational complexity; parallel algorithms; fast parallel DNA-based algorithms; molecular computation; molecular solutions; set-partition problem; signed parallel adder; signed parallel comparator; signed parallel subtractor; Algorithm design and analysis; Biology computing; Concurrent computing; Cryptography; DNA computing; Databases; Linear programming; NP-complete problem; NP-hard problem; Testing; DNA-based computing; the NP-complete problems; the NP-hard problems; Algorithms; Artificial Intelligence; Base Sequence; Computational Biology; Computer Simulation; Computers, Molecular; DNA; Numerical Analysis, Computer-Assisted;
fLanguage
English
Journal_Title
NanoBioscience, IEEE Transactions on
Publisher
ieee
ISSN
1536-1241
Type
jour
DOI
10.1109/TNB.2007.909012
Filename
4384669
Link To Document