1 / 12

DNA Computing Zhe Wang

DNA Computing Zhe Wang. Molecular computation of solutions to combinatorial problems. Adleman. Science 266, 1021-1024. 1994. Computing with DNA. Parker. EMBO reports 4, 7-10. 2003. DNA provides a compact means of data storage. Each

luther
Télécharger la présentation

DNA Computing Zhe Wang

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. DNA Computing Zhe Wang

  2. Molecular computation of solutions to combinatorial • problems. Adleman. Science 266, 1021-1024. 1994. • Computing with DNA. Parker. EMBO reports 4, 7-10. • 2003.

  3. DNA provides a compact means of data storage. Each • gram of DNA can contain more than 1021 bits of information. • Recombinant DNA techniques for detection, amplification, • and editing of DNA can be used for massively parallel • molecular computation. Routine experiments can involve • between 1015 and 1017 strands of DNA in a small test tube.

  4. The first DAN based computer was built by Adleman • In 1994. • It solved the Traveling Salesman problem (TSP) with • seven cities.

  5. TSP is a Hamiltonian path problem and NP-complete problem. There is a unique Hamiltonian path (01, 12, 23, 34, 45, 56) that begins with city 0 and ends with city 6.

  6. Using 20mer oligos to present each vertex and edge.

  7. Lane 1: Product of the ligation reaction. Lane2-5: PCR amplification of the product of the ligation reaction. Lane6: Molecular weight marker.

  8. Printing out the results by Graduated PCR. (Bands of 40, 60, 80, 100, 120, 140 bp in successive lanes represent a Hamiltonian path.)

  9. Purifying PCR products before printing out the results by Graduated PCR. (Bands of 40, 60, 80, 100, 120, 140 bp in successive lanes represent a Hamiltonian path.)

  10. DNA computing - Advantages • Computing with DNA has massive advantages over silicon-based machine. • Adleman’s DNA computer did 1,014 operations per second, a rate of 100 Trilion floating point operations per second (100 Teraflops). The world’s fastest supercomputer, Earth Simulator, runs at just 35.8 Teraflops. • Another advantage is the potential of information storage .

  11. DNA computing - Disadvantages • Printing out the result is a tedious work. • It requires an exponential amount of DNA to solve the TSP problem with high number of cities. • The most important problem is the accuracy of DNA strand synthesis.

  12. “The general consensus now is that DNA computing will never be able to compete directly with silicon-based technology.” • “The rich potential of DNA computing is to demonstrate control at the molecular level.”

More Related