Dna Computing: Presented by
Dna Computing: Presented by
Presented by:
Tara Bhushan (IT_2008_018)
IT 2nd year
RCC Institute of Information Technology
Contents
• Definition
• Internal Structure
• Limitations
• Future Possibilities
• Development Scale
• Environment Compatibility
• Conclusion
• References
DNA Computing
IMPORTANT:
A T
C G
DNA binding process
Two strings of DNA are bonded by paired nucleotides A-C and C-G which may be considered as
complements. Example:
a t c g t c a t a
g g c a c t
DNA 0 0 0
memory 1 0 1
strands
t a g c c c g t g a
a t c g t c a t a
g
1010101011 GATCGACTAC
Microchip computer
Vs
DNA computer
DNA is sensitive to chemical deterioration electronic data are vulnerable but can be backed up easily
Advantages
• There is always plentiful supply of it, so it is a cheap resource.
• DNA biochips can be made cleanly and are not toxic like silicon chips.
• DNA computers can be made many times smaller than today’s computers.
• Enormous parallelism.
A test tube of DNA can do trillions operation at a time.
• The computation time required to solve problems with a DNA computer does not grow exponentially, but
amount of DNA required DOES.
• Self Replication:
• Self Repair:
Research
1950’s … 1994 2000 2002 2003
• Combinatorial optimization.
• Still a lot of work and resources required to develop it into a fully fledged product.
References
• COMPUTING WITH DNA,Leonard M.Adleman,Scientific American, August 1998.
• Molecular Computation of Solutions to Combinatorial Problems”, L.M. Adleman, Science Vol.266 pp1021-
1024, 11 Nov 1994.
• http://colleges.ksu.edu.sa/.../DNA_orbit_animated.gif.
• http://en.wikipedia.org/wiki/DNA.
Thank You !