DNA computing
From Wikipedia, the free encyclopedia
DNA computing is a form of computing which uses DNA, biochemistry and molecular biology, instead of the traditional silicon-based computer technologies. DNA computing, or, more generally, molecular computing, is a fast developing interdisciplinary area. Research and development in this area concerns theory, experiments and applications of DNA computing.
Contents |
[edit] History
This field was initially developed by Leonard Adleman of the University of Southern California, in 1994.[1] Adleman demonstrated a proof-of-concept use of DNA as a form of computation which solved the seven-point Hamiltonian path problem. Since the initial Adleman experiments, advances have been made and various Turing machines have been proven to be constructible.[2] [3]
In 2002, researchers from the Weizmann Institute of Science in Rehovot, Israel, unveiled a programmable molecular computing machine composed of enzymes and DNA molecules instead of silicon microchips. [4] On April 28, 2004, Ehud Shapiro, Yaakov Benenson, Binyamin Gil, Uri Ben-Dor, and Rivka Adar at the Weizmann Institute announced in the journal Nature that they had constructed a DNA computer.[5] This was coupled with an input and output module and is capable of diagnosing cancerous activity within a cell, and then releasing an anti-cancer drug upon diagnosis.
[edit] Capabilities
DNA computing is fundamentally similar to parallel computing in that it takes advantage of the many different molecules of DNA to try many different possibilities at once.
For certain specialized problems, DNA computers are faster and smaller than any other computer built so far. But DNA computing does not provide any new capabilities from the standpoint of computability theory, the study of which problems are computationally solvable using different models of computation. For example, if the space required for the solution of a problem grows exponentially with the size of the problem (EXPSPACE problems) on von Neumann machines it still grows exponentially with the size of the problem on DNA machines. For very large EXPSPACE problems, the amount of DNA required is too large to be practical. (Quantum computing, on the other hand, does provide some interesting new capabilities).
DNA computing overlaps with, but is distinct from, DNA nanotechnology. The latter uses the specificity of Watson-Crick basepairing and other DNA properties to make novel structures out of DNA. These structures can be used for DNA computing, but they do not have to be. Additionally, DNA computing can be done without using the types of molecules made possible by DNA nanotechnology (as the above examples show).
[edit] Examples
[edit] See also
[edit] References
- ^ Leonard M. Adleman (1994-11-11). "Molecular Computation Of Solutions To Combinatorial Problems". Science (journal) 266 (11): 1021–1024. http://www.usc.edu/dept/molecular-science/papers/fp-sci94.pdf. — The first DNA computing paper. Describes a solution for the directed Hamiltonian path problem.
- ^ Dan Boneh, Christopher Dunworth, Richard J. Lipton, and Jiri Sgall (1996). "On the Computational Power of DNA". DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 71. http://citeseer.ist.psu.edu/boneh95computational.html. — Describes a solution for the boolean satisfiability problem.
- ^ Lila Kari, Greg Gloor, Sheng Yu (January 2000). "Using DNA to solve the Bounded Post Correspondence Problem". Theoretical Computer Science 231 (2): 192–203. http://citeseer.ist.psu.edu/kari00using.html. — Describes a solution for the bounded Post correspondence problem, a hard-on-average NP-complete problem.
- ^ Computer Made from DNA and Enzymes
- ^ Yaakov Benenson1, Binyamin Gil, Uri Ben-Dor, Rivka Adar, Ehud Shapiro (2004-04-28). "An autonomous molecular computer for logical control of gene expression". Nature (journal) 429: 423–429. http://www.wisdom.weizmann.ac.il/~lbn/other_links/ShapiroNature2004.pdf.
[edit] Additional Literatures
- Martyn Amos (June 2005). Theoretical and Experimental DNA Computation. Springer. ISBN 3-540-65773-8. http://www.springeronline.com/sgw/cda/frontpage/0,11855,3-0-22-1995351-0,00.html. — The first general text to cover the whole field.
- Gheorge Paun, Grzegorz Rozenberg, Arto Salomaa (October 1998). DNA Computing - New Computing Paradigms. Springer-Verlag. ISBN 3-540-64196-3. — The book starts with an introduction to DNA-related matters, the basics of biochemistry and language and computation theory, and progresses to the advanced mathematical theory of DNA computing.
- JB. Waldner (January 2007). Nanocomputers and Swarm Intelligence. ISTE. pp. 189. ISBN 2746215160.
[edit] External links
- How Stuff Works explanation
- Physics Web
- Ars Technica
- A Bibliography of Molecular Computation and Splicing Systems
- NY Times DNA Computer for detecting Cancer
- Bringing DNA computers to life, in Scientific American
- Japanese Researchers store information in bacteria DNA
- International Meeting on DNA Computing
