Exploring DNA Computing: Revolutionizing Problem Solving with Genetic Algorithms
This overview of DNA computing delves into the innovative use of DNA strands (adenine, thymine, guanine, cytosine) and polymerase in solving complex problems like the Hamiltonian Path problem. By creating all possible combinations of DNA strands in parallel, DNA computing can rapidly find solutions. While offering benefits such as speed, energy efficiency, and effective data storage, it also presents challenges including high costs, manual labor requirements, and potential for incorrect answers. This technology is set to change the landscape of algorithmic problem-solving.
Exploring DNA Computing: Revolutionizing Problem Solving with Genetic Algorithms
E N D
Presentation Transcript
DNA Computing By: Dane Greer and Jake Proehl
DNA • DNA Strands ATGC (adenine, thymine, guanine and cytosine) • Polymerase
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