A DNA-based simulation model for bounded fan-in Boolean circuits

Authors:
Mahnaz Kadkhoda;Ali A. Pouyan
Affiliations:
Department of Computer Engineering, University of Birjand, Birjand, Iran;Department of Computer Engineering, University of Birjand, Birjand, Iran
Venue:
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Year:
2006

Citing 5
Cited 0

The complexity of Boolean networks

The complexity of Boolean networks
Molecular computation of solutions to combinatorial problems

Science
The Complexity and Viability of DNA Computations

Biocomputing and emergent computation: Proceedings of BCEC97
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
On simultaneous resource bounds

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

DNA computing has recently gained intensive attention as an emerging field bridging the gap between computer science and biomolecular science. DNA based computing can be competitively used to simulate various computing models including Boolean circuits because of its potential to offer massive parallelism. In this paper we present a new DNA-based evaluation algorithm for a bounded fan-in circuit consisting of AND and OR gates. The proposed model employs standard bio-molecular techniques. The main advantage of our method is that each level of circuit is capable of containing both AND and OR gates. It is shown that large bounded fan-in circuits can be simulated by the proposed approach with a logarithmic slowdown in computation time.