DNA Computer
DNA computing is a form of computing which uses DNA and 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. R&D in this area concerns
theory, experiments and applications of DNA computing.
History
This field was initially developed by Leonard Adleman of the University of Southern California. In 1994, 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.
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.
The computer could perform 330 trillion operations per second, more
than 100,000 times the speed of the fastest PC. [1]
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. 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.
What is really a DNA Computer?
DNA replicates according to its sequences. So, based on initial input sequences (the problem to be solved), DNA replicates and create trillions of new sequences. The solution to the problem is one of those new sequence strands created that could be achieved by an elimination process.
Practically, the DNA computer looks like a solution in a test tube. There is no mechanical device. Instead of showing up on a computer screen, results are analyzed using a technique that allows scientists to see the length of the DNA output molecule.
In order to enable a convenient input of sequences and present the output to the naked eye, human manipulation is needed. In other words, no I/O devices exist yet for this kind of computer. This kind of computer is not practical yet and is in its initial stages.
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 computational complexity theory,
the study of which computational problems are difficult to solve. For
example, problems which grow exponentially with the size of the problem
(EXPSPACE problems) on von Neumann machines
still grow 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).
Examples of DNA computing
MAYA-II (Molecular Array of YES and AND logic gates) is a DNA computer, developed by scientists at Columbia University and the University of New Mexico.
Replacing the normally silicon-based circuits, this chip has DNA strands to form the circuit. It is said that the speed that such DNA-circuited
computer chips can attain will rival the silicon-based ones, they will
be of use in blood samples and in the body and might part-take in
single cell signaling.
It is the successor to the MAYA I which was composed of only 25 logic gates and could only complete a partial game of tic-tac-toe. MAYA-II has more than 100 DNA circuits and can now thoroughly play a game of tic-tac-toe.
It is very slow - one move in a game of tic-tac-toe can take up to 30
minutes making it more of a demonstration than an actual application.[1]
The arrangement of this device looks like that of a tic-tac-toe grid and consists of nine wells coated with culture cells. The cell-containing wells are filled with a solution that contain DNA strands coding for red or green fluorescent dyes.
This technology was used to deepen the quality of diagnostics given to patients infected with the West Nile virus. Joanne Macdonald,
a Columbia University virologist, hopes this device can be implanted in
the human body and control the presence of cancer cells or the levels
of insulin for diabetic patients.[2]
One of the suggested uses put forward by MAYA's creators is that
technology such as this can be used in situations where fluid is
involved, such as in a sample of blood or a body, since it does not use
traditional silicon components. [3]
See also
References
- ^ http://www.engadget.com/2006/10/16/meet-maya-ii-the-new-dna-computer-that-can-play-tic-tac-toe/
- ^ http://acswebapplications.acs.org/applications/ccs/application/index.cfm?PressReleaseID=2724&categoryid=2
- ^ https://digamma.cs.unm.edu/wiki/bin/view/McogPublicWeb/MolecularAutomataMAYAII MAYA-II
Computer with DNA Circuits Plays Games; One Day to Go Diagnostic. Medgadget.com (October 16, 2006). Retrieved on 2007-04-18.
Leonard M. Adleman (1994-11-11). "Molecular Computation Of Solutions To Combinatorial Problems". Science (journal) 266 (11): 1021–1024. — The first DNA computing paper. Describes a solution for the directed Hamiltonian path problem.
Martyn Amos (June 2005). Theoretical and Experimental DNA Computation. Springer. ISBN 3-540-65773-8. — The first general text to cover the whole field.
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. — Describes a solution for the boolean satisfiability problem.
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.
Lila Kari, Greg Gloor, Sheng Yu (January 2000). "Using DNA to solve the Bounded Post Correspondence Problem". Theoretical Computer Science 231 (2): 192–203. — Describes a solution for the bounded Post correspondence problem, a hard-on-average NP-complete problem.
JB. Waldner (January 2007). Nanocomputers and Swarm Intelligence. ISTE, 189. ISBN 2746215160.
The history of the International Meeting on DNA Computing (Proceedings - Links) -- [1]
- ^ http://news.nationalgeographic.com/news/2003/02/0224_030224_DNAcomputer.html
External links
This article is licensed under the GNU Free Documentation License. It uses material from Wikipedia Encyclopedia article "DNA Computing"
|