際際滷

際際滷Share a Scribd company logo

DNA Computing

Download as PPTX, PDF
Nidhi Verma
Nidhi Verma

This document discusses DNA computing. It begins with an introduction and then discusses the working principle, advantages, and limitations of DNA computing. Some key points made include: - DNA computing uses DNA to store information and perform complex calculations. It was first demonstrated by Leonard Adleman in 1994. - DNA computing has advantages like extremely dense information storage, enormous parallelism, and extraordinary energy efficiency. However, it also has limitations like high costs and occasional errors. - DNA computers show enormous potential, especially for medical purposes and data processing applications, but many issues still need to be overcome to produce a useful DNA computer.

1 of 20
Downloaded 25 times
DNA COMPUTING Name : Nidhi Verma Branch: Computer Science and Engineering Course: B.Tech 3rd year Roll No: 2014021034
Introduction Working Principle Advantages Limitations DNAVs Silicon Computers Conclusion
DNA Computing
A computer that uses DNA (deoxyribonucleic acids) to store information and perform complex calculations.
Leonard Adleman I believe things like DNA computing will eventually lead the way to a molecular revolution, which ultimately will have a very dramatic effect on the world.
DNA Computing
Extremely dense information storage. Enormous parallelism. Extraordinary energy efficiency.
. WHAT! 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 1x1014 MB of data.
A test tube of DNA can contain trillions of strands. Each operation on a test tube of DNA is carried out on all strands in the tube in parallel !
SO EXTRAORDINARY!
DNA Computing
In 1994 LeonardAdleman presented the first prototype of a DNA-Computer.TheTT- 100 was a test tube filled with 100 microliters of a DNA-solution. He managed to solve for example an instance of the directed Hamiltonian path problem
Algorithm
Hamilton Path Problem (also known as the travelling salesperson problem)
Strands of DNA represent the seven cities. In genes, genetic coding is represented by the letters A,T, C and G. Some sequence of these four letters represented each city and possible flight path. These molecules are then mixed in a test tube, with some of these DNA strands sticking together. A chain of these strands represents a possible answer. Within a few seconds, all of the possible combinations of DNA strands, which represent answers, are created in the test tube. Adleman eliminates the wrong molecules through chemical reactions, which leaves behind only the flight paths that connect all seven cities.
Parallel Computing Incredibly light weight Low power Solves Complex Problems quickly
High cost is time. 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
Feature DNA COMPUTER SILICON COMPUTER Miniaturization Unlimited Limited Processing Parallel Sequential Speed Very fast Slower Cost Cheaper Costly Materials used Non-toxic Toxic
DNA COMPUTERS SHOW ENORMOUS POTENTIAL,ESPECIALLY FOR MEDICAL PURPOSES AS WELL AS DATA PROCESSING APPLICATIONS. MANY ISSUES TO OVERCOME TO PRODUCE A USEFUL DNA COMPUTERS STILL A LOT OF WORK AND RESOURCES REQUIRED TO DEVELOP IT INTO A FULLY FLEDGED PRODUCT
Any query ? THANK YOU !

More Related Content

DNA Computing

  • 1. DNA COMPUTING Name : Nidhi Verma Branch: Computer Science and Engineering Course: B.Tech 3rd year Roll No: 2014021034
  • 2. Introduction Working Principle Advantages Limitations DNAVs Silicon Computers Conclusion
  • 4. A computer that uses DNA (deoxyribonucleic acids) to store information and perform complex calculations.
  • 5. Leonard Adleman I believe things like DNA computing will eventually lead the way to a molecular revolution, which ultimately will have a very dramatic effect on the world.
  • 7. Extremely dense information storage. Enormous parallelism. Extraordinary energy efficiency.
  • 8. . WHAT! 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 1x1014 MB of data.
  • 9. A test tube of DNA can contain trillions of strands. Each operation on a test tube of DNA is carried out on all strands in the tube in parallel !
  • 12. In 1994 LeonardAdleman presented the first prototype of a DNA-Computer.TheTT- 100 was a test tube filled with 100 microliters of a DNA-solution. He managed to solve for example an instance of the directed Hamiltonian path problem
  • 14. Hamilton Path Problem (also known as the travelling salesperson problem)
  • 15. Strands of DNA represent the seven cities. In genes, genetic coding is represented by the letters A,T, C and G. Some sequence of these four letters represented each city and possible flight path. These molecules are then mixed in a test tube, with some of these DNA strands sticking together. A chain of these strands represents a possible answer. Within a few seconds, all of the possible combinations of DNA strands, which represent answers, are created in the test tube. Adleman eliminates the wrong molecules through chemical reactions, which leaves behind only the flight paths that connect all seven cities.
  • 16. Parallel Computing Incredibly light weight Low power Solves Complex Problems quickly
  • 17. High cost is time. 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
  • 18. Feature DNA COMPUTER SILICON COMPUTER Miniaturization Unlimited Limited Processing Parallel Sequential Speed Very fast Slower Cost Cheaper Costly Materials used Non-toxic Toxic
  • 19. DNA COMPUTERS SHOW ENORMOUS POTENTIAL,ESPECIALLY FOR MEDICAL PURPOSES AS WELL AS DATA PROCESSING APPLICATIONS. MANY ISSUES TO OVERCOME TO PRODUCE A USEFUL DNA COMPUTERS STILL A LOT OF WORK AND RESOURCES REQUIRED TO DEVELOP IT INTO A FULLY FLEDGED PRODUCT