DNA algorithm for an unbounded fan-in Boolean circuit
- PMID: 15982801
- DOI: 10.1016/j.biosystems.2005.05.010
DNA algorithm for an unbounded fan-in Boolean circuit
Abstract
In this paper, we present a new DNA-based evaluation algorithm for a Boolean circuit that employs standard bio-molecular techniques. The algorithm operates on an unbounded fan-in Boolean circuit consisting of AND and OR gates. The whole simulation of our algorithm is proposed in a single test tube in O(1) time complexity and is much easier to implement in the laboratory than previously described models. Furthermore, the algorithm allows for evaluating any number of Boolean circuits in parallel in a single test tube.
Similar articles
-
A novel generalized design methodology and realization of Boolean operations using DNA.Biosystems. 2009 Sep;97(3):146-53. doi: 10.1016/j.biosystems.2009.05.010. Epub 2009 Jun 6. Biosystems. 2009. PMID: 19505531
-
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
-
Molecular solutions for the subset-sum problem on DNA-based supercomputing.Biosystems. 2004 Feb;73(2):117-30. doi: 10.1016/j.biosystems.2003.11.001. Biosystems. 2004. PMID: 15013224
-
Molecular Computation for Molecular Classification.Adv Biol (Weinh). 2023 Mar;7(3):e2200203. doi: 10.1002/adbi.202200203. Epub 2023 Jan 29. Adv Biol (Weinh). 2023. PMID: 36709492 Review.
-
An adaptive Boolean automation to model circadian cycles.Int J Neural Syst. 1996 Mar;7(1):83-99. doi: 10.1142/s0129065796000087. Int J Neural Syst. 1996. PMID: 8828052 Review.
MeSH terms
Substances
LinkOut - more resources
Full Text Sources