1. BY: DANE GREER AND JAKE PROEHL DNA COMPUTING

2. DNA DNA Strands ATGC (adenine, thymine, guanine and cytosine) Polymerase

3. POLYMERASE

4. DNA REPLICATION

5. WHAT IS DNA COMPUTING Uses Polymerase to create every possible combination of strands. This happens in parallel

6. DNA COMPUTING Probe molecule finds correct strand Chemical reaction then removes all incorrect strands What’s left is the solution to the problem

7. EXAMPLE Hamiltonian Path problem (A.K.A. Traveling Salesman)

8. BENEFITS Speed

9. BENEFITS CONT Storage

10. BENEFITS CONT Energy efficient.

11. DOWNSIDES Cost

12. DOWNSIDES Manual Labor

13. DOWNSIDES Feed

14. DOWNSIDES Wrong answers aren’t always eliminated

15. EFFECT ON ALGORITHMS Performs calculations in parallel Changes the focus of Algorithms

16. QUESTIONS?