BY: DANE GREER AND JAKE PROEHL DNA COMPUTING
DNA DNA Strands ATGC (adenine, thymine, guanine and cytosine) Polymerase
POLYMERASE
DNA REPLICATION
WHAT IS DNA COMPUTING Uses Polymerase to create every possible combination of strands. This happens in parallel
DNA COMPUTING Probe molecule finds correct strand Chemical reaction then removes all incorrect strands What’s left is the solution to the problem
EXAMPLE Hamiltonian Path problem (A.K.A. Traveling Salesman)
BENEFITS Speed
BENEFITS CONT Storage
BENEFITS CONT Energy efficient.
DOWNSIDES Cost
DOWNSIDES Manual Labor
DOWNSIDES Feed
DOWNSIDES Wrong answers aren’t always eliminated
EFFECT ON ALGORITHMS Performs calculations in parallel Changes the focus of Algorithms
QUESTIONS?