DNA computing

From Wikipedia, the free encyclopedia
Jump to: navigation, search
For hypothetical computers using brain-to-brain interfaces see Biological computer

DNA computing is a branch of computing which uses DNA, biochemistry and molecular biology hardware, instead of the traditional silicon-based computer technologies. DNA computing, or, more generally, biomolecular computing, is a fast-developing interdisciplinary area. Research and development in this area concerns theory, experiments, and applications of DNA computing. The term "molectronics" has sometimes been used, but this term had already been used for an earlier technology, a then-unsuccessful rival of the first integrated circuits;[1] this term has also been used more generally, for molecular-scale technology.[2]

History[edit]

This field was initially developed by Leonard Adleman of the University of Southern California, in 1994.[3] 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.[4][5]

While the initial interest was in using this novel approach to tackle NP-hard problems, it was soon realized that they may not be best suited for this type of computation, and several proposals have been made to find a "killer application" for this approach. In 1997, computer scientist Mitsunori Ogihara working with biologist Animesh Ray suggested one to be the evaluation of Boolean circuits and described an implementation.[6][7]

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.[8] 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 coupled with an input and output module which would theoretically be capable of diagnosing cancerous activity within a cell, and releasing an anti-cancer drug upon diagnosis.[9]

In January 2013, researchers were able to store a JPEG photograph, a set of Shakespearean sonnets, and an audio file of Martin Luther King, Jr.'s speech I Have a Dream on DNA digital data storage.[10]

In March 2013, researchers created a transcriptor (a biological transistor).

Idea[edit]

The organisation and complexity of all living beings is based on a coding system functioning with four key components of the DNA-molecule. Because of this, the DNA is very suited as a medium for data processing. According to different calculations a DNA-computer with one liter of fluid containing six grams of DNA could potentially have a memory capacity of 3072 Exabytes. On top of that, the theoretical maximum data transfer speed would be enormous due to the massive parallelism of the calculations. Therefore, about 1000 petaFLOPS/s could be reached, while today's most powerful computers do not go above a few dozen (33.86 petaFLOPS/s by Tianhe-2 being the current record holder).

Pros and cons[edit]

The slow processing speed of a DNA-computer (the response time is measured in minutes, hours or days, rather than milliseconds) is compensated by its potential to make a high amount of multiple parallel computations. This allows the system to take a similar amount of time for a complex calculation than for a simple one. This is achieved by the fact that millions or billions of molecules interact with each other simultaneously. However, it is a lot harder to analyse the answers given by a DNA-Computer than by a digital one.

Examples/Prototypes[edit]

In 1994 Leonard Adleman presented the first prototype of a DNA-Computer. The TT-100 was a test tube filled with 100 microliters of a DNA-solution. He managed to solve for example an instance of the directed Hamiltonian path problem.

In another experiment a simple version of the “travelling salesman problem” was “solved”. For this purpose, different DNA-fragments were created, each one of them representing a city that had to be visited. Every one of these fragments is capable of a linkage with the other fragments created. These DNA-fragments were produced and mixed in a test tube. Within seconds, the small fragments form bigger ones, representing the different travel routes. Through a chemical reaction (that lasts a few days), the DNA-fragments representing the longer routes were eliminated. The remains are the solution to the problem. However, because of technical restraints of our day and age, it is impossible to evaluate the results. Therefore, the experiment isn’t suitable for application, but it is nevertheless a proof of concept.

Combinatorial problems[edit]

First results to these problems were obtained by Leonard Adleman (NASA JPL)

Tic Tac Toe game[edit]

In 2002, J. Macdonald, D. Stefanovic and Mr. Stojanovic created a DNA computer able to play Tic-tac-toe against a human player.[11] The calculator consists of nine bins corresponding to the nine squares of the game. Each bin contains a substrate and various combinations of DNA enzymes. The substrate itself is composed of a DNA strand onto which was grafted a fluorescent chemical group at one end, and the other end, a repressor group. Fluorescence is only active if the molecules of the substrate are halved. The DNA enzyme simulate logical functions. For example, such a DNA will unfold if we introduce two specific types of DNA strand, reproducing the logic function AND.

By default, the computer is supposed to play first in the central square. The human player has then as a starter eight different types of DNA strands assigned to each of eight boxes that may be played. To indicate that box nr. i is being ticked, the human player pours into all bins the strands corresponding to input #i. These strands bind to certain DNA enzymes present in the bins, resulting in one of these two bins in the deformation of the DNA enzymes which binds to the substrate and cuts it. The corresponding bin becomes fluorescent, indicating which box is being played by the DNA computer. The various DNA enzymes are divided into various bins in s way to ensure the victory of the DNA computer against the human player.

Capabilities[edit]

DNA computing is a form of parallel computing in that it takes advantage of the many different molecules of DNA to try many different possibilities at once.[12] For certain specialized problems, DNA computers are faster and smaller than any other computer built so far. Furthermore, particular mathematical computations have been demonstrated to work on a DNA computer. As an example, DNA molecules have been utilized to tackle the assignment problem.[13] Aran Nayebi[14] has provided a general implementation of Strassen's matrix multiplication algorithm on a DNA computer, although there are problems with scaling. In addition, Caltech researchers have created a circuit made from 130 unique DNA strands, which is able to calculate the square root of numbers up to 15.[15]

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.

Methods[edit]

There are multiple methods for building a computing device based on DNA, each with its own advantages and disadvantages. Most of these build the basic logic gates (AND, OR, NOT) associated with digital logic from a DNA basis. Some of the different bases include DNAzymes, deoxyoligonucleotides, enzymes, toehold exchange.

DNAzymes[edit]

Catalytic DNA (deoxyribozyme or DNAzyme) catalyze a reaction when interacting with the appropriate input, such as a matching oligonucleotide. These DNAzymes are used to build logic gates analogous to digital logic in silicon; however, DNAzymes are limited to 1-, 2-, and 3-input gates with no current implementation for evaluating statements in series.

The DNAzyme logic gate changes its structure when it binds to a matching oligonucleotide and the fluorogenic substrate it is bonded to is cleaved free. While other materials can be used, most models use a fluorescence-based substrate because it is very easy to detect, even at the single molecule limit.[16] The amount of fluorescence can then be measured to tell whether or not a reaction took place. The DNAzyme that changes is then “used,” and cannot initiate any more reactions. Because of this, these reactions take place in a device such as a continuous stirred-tank reactor, where old product is removed and new molecules added.

Two commonly used DNAzymes are named E6 and 8-17. These are popular because they allow cleaving of a substrate in any arbitrary location.[17] Stojanovic and MacDonald have used the E6 DNAzymes to build the MAYA I[18] and MAYA II[19] machines, respectively; Stojanovic has also demonstrated logic gates using the 8-17 DNAzyme.[20] While these DNAzymes have been demonstrated to be useful for constructing logic gates, they are limited by the need for a metal cofactor to function, such as Zn2+ or Mn2+, and thus are not useful in vivo.[16][21]

A design called a stem loop, consisting of a single strand of DNA which has a loop at an end, are a dynamic structure that opens and closes when a piece of DNA bonds to the loop part. This effect has been exploited to create several logic gates. These logic gates have been used to create the computers MAYA I and MAYA II which can play tic-tac-toe to some extent.[22]

Enzymes[edit]

Enzyme based DNA computers are usually of the form of a simple Turing machine; there is analogous hardware, in the form of an enzyme, and software, in the form of DNA.[23]

Benenson, Shapiro and colleagues have demonstrated a DNA computer using the FokI enzyme[24] and expanded on their work by going on to show automata that diagnose and react to prostate cancer: under expression of the genes PPAP2B and GSTP1 and an over expression of PIM1 and HPN.[9] Their automata evaluated the expression of each gene, one gene at a time, and on positive diagnosis then released a single strand DNA molecule (ssDNA) that is an antisense for MDM2. MDM2 is a repressor of protein 53, which itself is a tumor suppressor.[25] On negative diagnosis it was decided to release a suppressor of the positive diagnosis drug instead of doing nothing. A limitation of this implementation is that two separate automata are required, one to administer each drug. The entire process of evaluation until drug release took around an hour to complete. This method also requires transition molecules as well as the FokI enzyme to be present. The requirement for the FokI enzyme limits application in vivo, at least for use in “cells of higher organisms”.[26] It should also be pointed out that the 'software' molecules can be reused in this case.

Toehold exchange[edit]

DNA computers have also been constructed using the concept of toehold exchange. In this system, an input DNA strand binds to a sticky end, or toehold, on another DNA molecule, which allows it to displace another strand segment from the molecule. This allows the creation of modular logic components such as AND, OR, and NOT gates and signal amplifiers, which can be linked into arbitrarily large computers. This class of DNA computers does not require enzymes or any chemical capability of the DNA.[27]

Algorithmic self-assembly[edit]

DNA arrays that display a representation of the Sierpinski gasket on their surfaces. Click the image for further details. Image from Rothemund et al., 2004.[28]

DNA nanotechnology has been applied to the related field of DNA computing. DNA tiles can be designed to contain multiple sticky ends with sequences chosen so that they act as Wang tiles. A DX array has been demonstrated whose assembly encodes an XOR operation; this allows the DNA array to implement a cellular automaton which generates a fractal called the Sierpinski gasket. This shows that computation can be incorporated into the assembly of DNA arrays, increasing its scope beyond simple periodic arrays.[28]

Alternative technologies[edit]

A partnership between IBM and CalTech was established in 2009 aiming at “DNA chips” production.[29] A CalTech group is working on the manufacturing of these nucleic-acid-based integrated circuits. One of these chips can compute whole square roots.[30] A compiler has been written [31] in Perl.

See also[edit]

References[edit]

  1. ^ "Molectronic Computer Shown by Texas Instr.", unknown publication, circa 1963, in Box 2, Folder 3, listed in Jack Kilby Papers: A Guide to the Collection, Southern Methodist University. [1] .
  2. ^ "Application-specific methods for testing molectronic or nanoscale devices" (filed April 1, 2004), Patent US 7219314 B1. [2] .
  3. ^ Adleman, L. M. (1994). "Molecular computation of solutions to combinatorial problems". Science 266 (5187): 1021–1024. doi:10.1126/science.7973651. PMID 7973651.  edit — The first DNA computing paper. Describes a solution for the directed Hamiltonian path problem. Also available here: [3]
  4. ^ Boneh, D.; Dunworth, C.; Lipton, R. J.; Sgall, J. Í. (1996). "On the computational power of DNA". Discrete Applied Mathematics 71: 79–94. doi:10.1016/S0166-218X(96)00058-3.  edit — Describes a solution for the boolean satisfiability problem. Also available here: [4]
  5. ^ Lila Kari, Greg Gloor, Sheng Yu (January 2000). "Using DNA to solve the Bounded Post Correspondence Problem". Theoretical Computer Science 231 (2): 192–203. doi:10.1016/s0304-3975(99)00100-0.  — Describes a solution for the bounded Post correspondence problem, a hard-on-average NP-complete problem. Also available here: [5]
  6. ^ M. Ogihara and A. Ray, "Simulating Boolean circuits on a DNA computer". Algorithmica 25:239–250, 1999.
  7. ^ "In Just a Few Drops, A Breakthrough in Computing", New York Times, May 21, 1997
  8. ^ Lovgren, Stefan (2003-02-24). "Computer Made from DNA and Enzymes". National Geographic. Retrieved 2009-11-26. 
  9. ^ a b Benenson, Y.; Gil, B.; Ben-Dor, U.; Adar, R.; Shapiro, E. (2004). "An autonomous molecular computer for logical control of gene expression". Nature 429 (6990): 423–429. doi:10.1038/nature02551. PMC 3838955. PMID 15116117.  edit. Also available here: [6]
  10. ^ [7]
  11. ^ [FR] - J. Macdonald, D. Stefanovic et M. Stojanovic, Des assemblages d'ADN rompus au jeu et au travail, Pour la Science, Template:N°, January 2009, p. 68-75
  12. ^ Lewin, D. I. (2002). "DNA computing". Computing in Science & Engineering 4 (3): 5–8. doi:10.1109/5992.998634.  edit
  13. ^ Shu, Jian-Jun; Wang, Q.-W.; Yong, K.-Y. (2011). "DNA-based computing of strategic assignment problems". Physical Review Letters 106 (18): 188702. doi:10.1103/PhysRevLett.106.188702. 
  14. ^ Nayebi, Aran (2009). "Fast matrix multiplication techniques based on the Adleman-Lipton model". arXiv: 0912.0750: 1–13. 
  15. ^ Science NewsFlexbile DNA computer finds square roots
  16. ^ a b Weiss, S. (1999). "Fluorescence Spectroscopy of Single Biomolecules". Science 283 (5408): 1676–1683. doi:10.1126/science.283.5408.1676. PMID 10073925.  edit. Also available here: http://www.lps.ens.fr/~vincent/smb/PDF/weiss-1.pdf
  17. ^ Santoro, S. W.; Joyce, G. F. (1997). "A general purpose RNA-cleaving DNA enzyme". Proceedings of the National Academy of Sciences 94 (9): 4262–4266. doi:10.1073/pnas.94.9.4262.  edit. Also available here: [8]
  18. ^ Stojanovic, M. N.; Stefanovic, D. (2003). "A deoxyribozyme-based molecular automaton". Nature Biotechnology 21 (9): 1069–1074. doi:10.1038/nbt862. PMID 12923549.  edit. Also available here: [9]
  19. ^ MacDonald, J.; Li, Y.; Sutovic, M.; Lederman, H.; Pendri, K.; Lu, W.; Andrews, B. L.; Stefanovic, D.; Stojanovic, M. N. (2006). "Medium Scale Integration of Molecular Logic Gates in an Automaton". Nano Letters 6 (11): 2598–2603. doi:10.1021/nl0620684. PMID 17090098.  edit. Also available here: [10]
  20. ^ Stojanovic, M. N.; Mitchell, T. E.; Stefanovic, D. (2002). "Deoxyribozyme-Based Logic Gates". Journal of the American Chemical Society 124 (14): 3555–3561. doi:10.1021/ja016756v. PMID 11929243.  edit. Also available at [11]
  21. ^ Cruz, R. P. G.; Withers, J. B.; Li, Y. (2004). "Dinucleotide Junction Cleavage Versatility of 8-17 Deoxyribozyme". Chemistry & Biology 11: 57–67. doi:10.1016/j.chembiol.2003.12.012.  edit
  22. ^ Darko Stefanovic's Group, Molecular Logic Gates and MAYA II, a second-generation tic-tac-toe playing automaton.
  23. ^ Shapiro, Ehud (1999-12-07). "A Mechanical Turing Machine: Blueprint for a Biomolecular Computer". Weizmann Institute of Science. Retrieved 2009-08-13. 
  24. ^ Benenson, Y.; Paz-Elizur, T.; Adar, R.; Keinan, E.; Livneh, Z.; Shapiro, E. (2001). "Programmable and autonomous computing machine made of biomolecules". Nature 414 (6862): 430–434. doi:10.1038/35106533. PMID 11719800.  edit. Also available here: [12]
  25. ^ Bond, G. L.; Hu, W.; Levine, A. J. (2005). "MDM2 is a Central Node in the p53 Pathway: 12 Years and Counting". Current Cancer Drug Targets 5 (1): 3–8. doi:10.2174/1568009053332627. PMID 15720184.  edit
  26. ^ Kahan, M.; Gil, B.; Adar, R.; Shapiro, E. (2008). "Towards molecular computers that operate in a biological environment". Physica D: Nonlinear Phenomena 237 (9): 1165–1172. Bibcode:2008PhyD..237.1165K. doi:10.1016/j.physd.2008.01.027.  edit. Also available here: [13]
  27. ^ Seelig, G.; Soloveichik, D.; Zhang, D. Y.; Winfree, E. (8 December 2006). "Enzyme-free nucleic acid logic circuits". Science 314 (5805): 1585–1588. doi:10.1126/science.1132493. PMID 17158324.  edit
  28. ^ a b Rothemund, P. W. K.; Papadakis, N.; Winfree, E. (2004). "Algorithmic Self-Assembly of DNA Sierpinski Triangles". PLoS Biology 2 (12): e424. doi:10.1371/journal.pbio.0020424. PMC 534809. PMID 15583715.  edit
  29. ^ [14](CalTech's own article)
  30. ^ [15]
  31. ^ [16] Online

Further reading[edit]

  • Martyn Amos (June 2005). Theoretical and Experimental DNA Computation. Springer. ISBN 3-540-65773-8.  — 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. p. 189. ISBN 2-7462-1516-0. 
  • Zoja Ignatova, Israel Martinez-Perez, Karl-Heinz Zimmermann (January 2008). DNA Computing Models. Springer. p. 288. ISBN 978-0-387-73635-8.  — A new general text to cover the whole field.

External links[edit]