dna computing zhe wang

12
DNA Computing Zhe Wang

Upload: luther

Post on 22-Jan-2016

41 views

Category:

Documents


0 download

DESCRIPTION

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 - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: DNA Computing Zhe Wang

DNA Computing

Zhe Wang

Page 2: DNA Computing Zhe Wang

• Molecular computation of solutions to combinatorialproblems. Adleman. Science 266, 1021-1024. 1994.

• Computing with DNA. Parker. EMBO reports 4, 7-10. 2003.

Page 3: DNA Computing Zhe Wang

• 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.

Page 4: DNA Computing Zhe Wang

• The first DAN based computer was built by Adleman In 1994.

• It solved the Traveling Salesman problem (TSP) with seven cities.

Page 5: DNA Computing Zhe Wang

TSP is a Hamiltonian path problem and NP-complete problem.

There is a unique Hamiltonian path (01, 12, 23, 34, 45, 56)that begins with city 0 and ends with city 6.

Page 6: DNA Computing Zhe Wang

Using 20mer oligos to present each vertex and edge.

Page 7: DNA Computing Zhe Wang

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

Page 8: DNA Computing Zhe Wang

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

Page 9: DNA Computing Zhe Wang

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

Page 10: DNA Computing Zhe Wang

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 .

Page 11: DNA Computing Zhe Wang

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.

Page 12: DNA Computing Zhe Wang

• “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.”