Fast Parallel DNA-Based Algorithms for Molecular Computation: The Set-Partition Problem

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 molecula...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on nanobioscience Vol. 6; no. 4; pp. 346 - 353
Main Author Chang, Weng-Long
Format Magazine Article
LanguageEnglish
Published United States IEEE 01.12.2007
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithm design and analysis
Algorithms
Artificial Intelligence
Base Sequence
Biological
Biology computing
Comparators
Computation
Computational Biology - methods
Computer Simulation
Computers, Molecular
Concurrent computing
Cryptography
DNA - chemistry
DNA - genetics
DNA computing
DNA-based computing
Linear programming
Mathematical models
Nanocomposites
Nanomaterials
Nanostructure
NP-complete problem
NP-hard problem
Numerical Analysis, Computer-Assisted
Testing
the NP-complete problems
the NP-hard problems
Online AccessGet full text
ISSN1536-1241
1558-2639
DOI10.1109/TNB.2007.909012

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1536-1241
1558-2639
DOI:10.1109/TNB.2007.909012