Referenced Items are not available for this document.
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.
Published in:
NanoBioscience, IEEE Transactions on
(Volume:6
,
Issue:
4
)
Date of Publication: Dec. 2007
- Page(s):
- 346 - 353
- ISSN :
- 1536-1241
- INSPEC Accession Number:
- 9757220
- Digital Object Identifier :
- 10.1109/TNB.2007.909012
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 04 December 2007
- Issue Date :
- Dec. 2007
- Sponsored by :
- IEEE Computational Intelligence Society
- PubMed ID :
- 18217628
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
