doi: 10.1016/j.biosystems.2003.11.001.
Molecular solutions for the subset-sum problem on DNA-based supercomputing
Affiliations
- PMID: 15013224
- DOI: 10.1016/j.biosystems.2003.11.001
Item in Clipboard
Molecular solutions for the subset-sum problem on DNA-based supercomputing
Biosystems.
2004 Feb.
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.
Similar articles
-
Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem.Biosystems. 2005 Jun;80(3):233-50. doi: 10.1016/j.biosystems.2004.11.009. Biosystems. 2005. PMID: 15981311
-
Fast parallel DNA-based algorithms for molecular computation: the set-partition problem.IEEE Trans Nanobioscience. 2007 Dec;6(4):346-53. doi: 10.1109/tnb.2007.909012. IEEE Trans Nanobioscience. 2007. PMID: 18217628
-
DNA algorithm for an unbounded fan-in Boolean circuit.Biosystems. 2005 Oct;82(1):52-60. doi: 10.1016/j.biosystems.2005.05.010. Biosystems. 2005. PMID: 15982801
-
The surface-based approach for DNA computation is unreliable for SAT.Biosystems. 2005 Oct;82(1):20-5. doi: 10.1016/j.biosystems.2005.05.007. Biosystems. 2005. PMID: 16024166
-
Multiple sequence alignments.Curr Opin Struct Biol. 2005 Jun;15(3):261-6. doi: 10.1016/j.sbi.2005.04.002. Curr Opin Struct Biol. 2005. PMID: 15963889 Review.
Cited by
-
Fast parallel molecular algorithms for DNA-based computation: solving the elliptic curve discrete logarithm problem over GF2.J Biomed Biotechnol. 2008;2008:518093. doi: 10.1155/2008/518093. J Biomed Biotechnol. 2008. PMID: 18431451 Free PMC article.
MeSH terms
Substances
LinkOut - more resources
Full Text Sources
