Académique Documents
Professionnel Documents
Culture Documents
“DNA COMPUTING”
Under the Guidance of
Mr. S.B Neelamani
Submitted by
β i (t ) = ∑ α j (t )
j = i +1
Parallelism
Gigantic Memory Capacity
information density =1 bit per cubic nanometer
data density = 18 Megabits per inch
If assumed one base per square nanometer, the data density ≥ one
million Gigabits per square inch but data density of a typical high
performance hard driver, which is about 7 gigabits per square inch
Low Power Dissipation
Clean, Cheap and Available
clean because people do not use any harmful material to
produce it and also no pollution generates
cheap and available because you can easily find DNA from
nature while it’s not necessary to exploit mines
Occasionally Slow
Hydrolysis
The DNA molecules can fracture. Over the six months you're
computing your DNA system is gradually turning to water
Information Untransmittable
Current DNA algorithms compute successfully without passing
any information from one processor to the next in a multiprocessor
connection-bus
Reliability Problems
Errors in DNA Computers happen due to many factors
Annealing (or hybridization) Errors while combine with the proper
DNA complements
Misincorporation errors while synthesizing the copies of the
DNA strands in Polymerase Chain Reaction (PCR)