2. A PRESENTATION ON DNA COMPUTING Presented By SOMYA JAIN

3. What is DNA ?  DNA stands for Deoxyribonucleic Acid  All organisms on this planet are made of the same type of genetic element.  DNA carries the genetic information of a cell.

4.  Within the cells of any organism is a substance called DNA which is a double stranded helix of nucleotides. Each strand is a series of 4 different nucleotides Adenine (A) Guanine (G) Thymine (T) Cytosine (C)

5. DNA Structure

6. DNA Structure :- The key thing to note about the structure of DNA is it’s inherent complementarity A binds with T and G binds with C One strand is therefore the “mirror image of another”

7. Complement of AGGCT is TCCGA Complement of TAGGA is ATCCT Complement of GATTACCA is CTAATGGT Interesting Facts : DNA molecule is 1.7 meters long Stretch out all the DNA in your cells and you can reach the moon 6000 times!

8. DNA Computing :- Around 1950 first idea (Precursor Feynman) First important experiment 1994: Leonard Adleman Molecular level (just greater than 10 -9 meter) In only 5 grams of DNA we get around 10 21 bases ! Each DNA strand represents a processor !

9. The Hamiltonian Path Problem(HPP): A Hamiltonian path in a graph is a path visiting each node only once, starting and ending at a given locations. Traveling Salesmen Problem : Adleman’s Experiment Chicago Los Angeles Dallas Miami New York Here each city is being treated as a node

10. Steps To Follow:-  Generate all possible routes.  Select path that start with the proper city and end with final city.  Select path with the correct no. of cities.  Select path that contain each city only once.

11. Part I-  Encode city names in short DNA sequences. Encode path by connecting the city sequence for which routes exist. Miami C T A C G G Miami to NewYork G C C T A C NewYork A T G C C G City Encoding Route Encoding Miami C T A C G G NewYork A T G C C G G C C T A C Miami to NewYork Hybridized DNA Los AngelesGCTACG ChicagoCTAGTA DallasTCGTAC MiamiCTACGG New YorkATGCCG

12. Why DNA computing ? As convential computers have a Limit of miniaturization, beyond that they can not be miniaturize. Have a limited range of speed.

13. Massive parallel machines (potential) :- Desktop PC : 10 9 ops/sec Supercomputer : 10 12 ops/sec 1 µmol of DNA : 10 26 reactions… isn’t amazing…??

14. Dense Information Storage : This image shows 1 gram of DNA on a CD. The CD can hold 800 MB of data. The 1 gram of DNA can hold about 1x10 14 MB of data. The number of CDs required to hold this amount of information, lined up edge to edge, would circle the Earth 375 times, and would take163,000 centuries to listen.

15. Uniqueness of DNA How Dense is the Information Storage?. A test tube of DNA can contain trillions of strands. Every operation treat as a parallel.

16. MAYA-II First DNA computer :- Stand for (Molecular Array of YES and AND logic gate ) Replacing the normally silicon-based circuits, this chip has DNA strands to form the circuit MAYA-II has more than 100 DNA circuits

17. Advantages of a DNA Computer:- Parallel Computing- DNA computers are massively parallel. :- Now what is parallel computing ? Low power- The only power needed is to keep DNA from denaturing. Solves Complex Problems quickly- A DNA computer can solve hardest of problems in a matter of weeks

18. [ 2+2*345+87(43/34*765*90*123^4*564+98)-675+908 ]

19. Disadvantages of DNA Computer:-  Occasionally slower-Simple problems are solved much faster on electronic computers.  It can take longer to sort out the answer to a problem than it took to solve the problem.  Reliability- There is sometime errors in the pairing of DNA strands..(kundali software)

20. THANK YOU !!!! ?