Abstract
Computation using biological Deoxyribonucleic acid (DNA) strand is increasingly found to be a viable proposition. A unique generalized efficient algorithm for forming any Boolean circuit strand is proposed in this paper. The implementation of the Boolean circuit using the proposed algorithm is also presented. This Boolean circuit requires only one kind of bio-operation at each level. Further, this paper adopts a uniform representation for logical 0 and 1 for all Boolean circuit. Simulation to validate the efficient algorithm is also presented in this work.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have