Simplification of Boolean Algebra through DNA Computing

DNA Computing utilizes the properties of DNA for performing the computations. The computations include arithmetic and logical operations such as simplification of Boolean expression to its simplest form. Boolean function can be built from ANDs, ORs, and NOTs using minterm expansion. However, a practicing computer engineer will very rarely be satisfied with a minterm expansion, because as a rule, it requires more gates than necessary. The laws and identities of Boolean algebra will almost always allow us to simplify a minterm expansion. The efficiency of a logic circuit is high when the number of logic gates used to build it is small. However, minterm expression may be often simplified to a simpler Boolean expression, which can be implemented with fewer logic gates. In this paper we introduced a new DNA computing algorithm for reducing any Boolean expression to its simplest form by using DNA strands. The major benefits of this method are its extraordinary information density, vast parallelism and ease of operation. In addition the most merit of this DNA Algorithm is its automation characteristics, and simple coding steps.