dna

1. DNA Computer
• Presented by:-
Shahenaz Aghariya
Roll no :- 02
(6th
IT)

2. Introduction To
DNA Computer
• Store Billions of time more
information.
• High computing speed.
• Information is encoded within
‘Deoxiribo Nucleic Acid’.
• First Demonstrated By Ad leman in
1994.

3. Some information about DNA
• Definition of DNA
• About nucleic acid
• Genes and
chromosomes

4. Structure of DNA
• Strands of DNA are
long polymers of
millions of linked
nucliotides.
• Nitrogen bases .
• 5’ to 3’ direction.
• Double Helix form.
• Purin and pirimidin
bases.

5. Operations on DNA
• Merge
• Annealing
• Melt
• Separation by length - Electophoresis.
• Separation by sequences
• Copying / Amplification
• Append
• Detect

6. Adleman’s Hamilton Path
Problem
• Why his work is
exceptional?

7. Adleman’s Expriment
Following are the steps used by Adleman.
1.Generate all possible routes
2.Select journey that start with proper city
and end with final city.
3.Select journey with the correct number of
cities.
4.Select journey that contain each city only
once.

8. How DNA Computer will work?
• Development of logic gates made of DNA.

9. Comparison between DNA and
conventional electronic
computer
• Similarities:-
1. Transformation of data
2. Manipulation of data
3. Computation ability
• Differences:-
1. Size
2. Representation of data
3. Material
4. Methods of calculation

10. Advantages
• Parallelism
• Memory capacity
• Low power dissipation
• Clean,cheap and available

11. Key benefits
• Predictability
• Incredibly cheap
• Small size

12. Drawbacks
• Occasionally slow
• Hydrolysis
• Information on transmitable
• Reliability problems

13. Conclusion
• I would like to conclude by sharing a
future vision in which a single drop of
water holds a veritable army of live
robots for protection against various
diseases may be even cancer.
• It is still science fiction but implanting
computer programs in to living creatures
may not be far away.