DNA algorithm for an unbounded fan-in Boolean circuit.
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.
Department of Mathematics and Computer Science, Faculty of Science, University of Tehran, Tehran, Iran. ahrabian@ut.ac.ir
Hayedeh
H
Ahrabian
Mohammad
M
Ganjtabesh
Abbas
A
Nowzari-Dalini
D000465:Algorithms; D003198:Computer Simulation; D039301:Computers, Molecular; D004247:DNA / Q000737:chemistry* / Q000235:genetics*; D016015:Logistic Models; D008957:Models, Genetic; D012815:Signal Processing, Computer-Assisted
D004247:DNA