Relating the Minimum Model for DNA Computation and Boolean Circuits
نویسنده
چکیده
This paper provides a refinement of the minimum DNA computational model by [OR98b], which assumes the smallest set of permissible biochemical operations. The power of the refined model is characterized in terms of standard Boolean circuit complexity classes.
منابع مشابه
A Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملSimulating Boolean circuits by finite splicing
As a computational model to be simulated in a DNA computing context, Boolean circuits are especially interesting because of their parallelism. Simulations in concrete biochemical computing settings have been given by [OR96] and [AD97]. In this paper, we show how to simulate Boolean circuits by finite splicing systems, an abstract model of enzymatic recombination ([Hea87], [Gat94], [Pǎu96a]). We...
متن کاملDNA-Based Self-Propagating Algorithm for Solving Bounded-Fan-In Boolean Circuits
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleavage. The advantage of the current method is the requirement of little human intervention during the course of simulation. The paper also explores the potential of RecA-assisted DNA-DNA hybridization in DNA-based computation. The method could in principle allow simulation of many levels of large B...
متن کاملA DNA-Based Simulation Model for Bounded Fan-in Boolean Circuits
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 circui...
متن کاملSimulation of Parallel Logical Operations with Biomolecular Computing
Biomolecular computing is the computational method that uses the potential of DNA as a parallel computing device. DNA computing can be used to solve NP-complete problems. An appropriate application of DNA computation is large-scale evaluation of parallel computation models such as Boolean Circuits. In this study, we present a molecular-based algorithm for evaluation of Nand-based Boolean Circui...
متن کامل