DNA Computation Based Approach for Enhanced
Computing Power
Kashif Hammed
Department of Computer Science
The Islamia University of Bahawalpur
Bahawalpur, Pakistan gnetle_kashif@yahoo.com Abstract. DNA computing is a discipline that aims at harnessing individual molecules at the nano-scopic level for computational purposes. Computation with DNA molecules possesses an inherent interest for researchers in computers and biology. Given its vast parallelism and high-density storage,
DNA computing approaches are employed to solve many problems. DNA has also been explored as an excellent material and a fundamental building block for building large-scale nanostructures, constructing individual nanomechanical devices, and performing computations. Molecular-scale autonomous programmable computers are demonstrated allowing both input and output information to be in molecular form. This paper presents a review of recent advancements in DNA computing and presents major achievements and challenges for researchers in the coming future.
Keywords: DNA Computation, Computing Power, Evolutionary Computing
1. INTRODUCTION
Ever since scientists discovered that conventional silicon based computers have an upper limit in terms of speed, they have been searching for an alternative media with which to solve computational problems. The search led to DNA.
DNA computing is a method of solving computational problems with the help of biological and chemical operations on DNA strand. It was introduced by
Adleman [1]. Since then more and more researchers are motivated by the promising future of this area and start working on it.
DNA is a basic storage medium for all living cells. The main function of DNA is to transmit or absorb the data of life for billion years. Roughly 10 trillion DNA molecules could fit into a space the size of a marble. Since all these molecules can process data
References: Adleman, L. M. Molecular computation of solutions to combinatorial problems. Science, 266(11):1021-1024, 1994. Zingel, T. Formal Models of DNA Computing: A Survey. Proc. Estonian Acad. Sci. Phys. Math., 49, 2, 90–99, 2000. A .Narayanan and S.Zorbalas, DNA algorithm for computing shortest paths, Proc. of the Genetic Programming, Morgan Kaufman, p p.718-723, 1998. J. C. Adams, on the application of DNA based computing, available online at: http://publish.uwo.ca/jadams/dnaapps1.htm, 14 Jan, 2008. Will Ryu, “DNA Computing: A Primer”, Ars Technica, 2002 37