Molecular solutions for the subset-sum problem on DNA-based supercomputing
- PMID: 15013224
- DOI: 10.1016/j.biosystems.2003.11.001
Molecular solutions for the subset-sum problem on DNA-based supercomputing
Abstract
In this paper our main purpose is to give molecular solutions for the subset-sum problem. In order to achieve this, we propose a DNA-based algorithm of an n-bit parallel adder and a DNA-based algorithm of an n-bit parallel comparator to formally verify our designed molecular solutions for the subset-sum problem.
MeSH terms
Substances
LinkOut - more resources
Full Text Sources