SEMINAR

ON
BIOMOLECULAR COMPUTING
 Presentation Outline

 Basic concepts of Bio-molecules

 Origin of Biomolecular Computing
 Solution for NP-Complete Problems
 Advantages of DNA Computing
 Problems with Adleman’s Experiment
 DNA Computers
 Current research
 Conclusion
 What is DNA?

 DNA stands for Deoxyribonucleic Acid

 DNA represents the genetic blueprint of livi
ng creatures
 DNA contains “instructions” for assembling
cells
 Every cell in human body has a complete
set of DNA
 DNA is unique for each individual
Double Helix shape of DNA

 The two strands of a DNA mole

cule are anti parallel where each
strand runs in an opposite directi
on.
 Complementary base pairs
Adenine & Thymine
Guanine & Cytosine
 Two strands are held together
by weak hydrogen bonds betwee
n the complementary base pairs
 Instructions in DNA
Sequence to indicate the
start of an instruction

………

Instruction that triggers

Instruction for hair cells
Hormone injection
 Instructions are coded in a sequence of the DNA base
s
 A segment of DNA is exposed, transcribed and transl
ated to carry out instructions
DNA Duplication
 Basics and
Origin of DNA Computing
 DNA computing is utilizing the property of DNA for massi
vely parallel computation.

 With an appropriate setup and enough DNA, one can pot

entially solve huge problems by parallel search.

 Utilizing DNA for this type of computation can be much fa

ster than utilizing a conventional computer

 Leonard Adleman proposed that the makeup of DNA and

its multitude of possible combining nucleotides could hav
e application in computational research techniques
 Dense Information Storage
 This image shows 1 gra
m of DNA on a CD. The
CD can hold 800 MB of d
ata.

 The 1 gram of DNA can

hold about 1x1014 MB of
data.

 With bases spaced at 0.3

5 nm along DNA, data de
nsity is over a million Gbi
ts/inch compared to 7 Gb
its/inch in typical high per
formance HDD.
 How Dense is the Information Storage?

 Check this out………..

1 gram = 4x10 21
 How enormous is the parallelism?

 A test tube of DNA can contain trillions of strand

s. Each operation on a test tube of DNA is carrie
d out on all strands in the tube in parallel !

 Check this out……. We Typically use

3 x1014
 Steps for Adleman’s Experiment

 Strands of DNA represent the seven cities. In genes, gen

etic coding is represented by the letters A, T, C and G. S
ome sequence of these four letters represented each city
and possible flight path.
 These molecules are then mixed in a test tube, with som
e of these DNA strands sticking together. A chain of thes
e strands represents a possible answer.
 Within a few seconds, all of the possible combinations of
DNA strands, which represent answers, are created in th
e test tube.
 Adleman’s Experiment

 Hamilton Path Problem

(also known as the travelling salesperson problem)
DELHI

TVM KOLLAM BOMBAY

CHENNAI

BGLRE

Is there any Hamiltonian path from KOLLAM to DELHI?

 Subsequently logic gates can be employed using
DNA.
 Logic gates made up of DNA, instead of using
electrical signals to perform logical functions, rely on
DNA code.
 They detect fragments of genetic material as input,
splice together these fragments and form a single
output.
 The researchers believe that these logic gates might
be combined with DNA microchips to create a
breakthrough in DNA computing.
 Operations

 Melting
breaking the weak hydrogen bonds in a double h
elix to form two DNA strands which are complem
ent to each other
 Annealing
reconnecting the hydrogen bonds between com
plementary DNA strands
 Operations (Cont’d)

 Merging
mixing two test tubes with many DNA molecules
 Amplification
DNA replication to make many copies of the origi
nal DNA molecules
 Selection
elimination of errors (e.g. mutations) and selecti
on of correct DNA molecules
 Advantages of a DNA Computer
 Parallel Computing  Millions of operation
s simultaneously
 Incredibly light weig
ht  Generate potential s
olutions
 Low power
 Efficiently handle m
 Solves Complex Pro assive amounts of w
blems quickly orking memory
Current Research
 EDNA
 EDNA is object oriented and extensible, so that it can ea
sily evolve as the field progresses.

 EDNA is therefore a research tool that makes it possible

to use the advantages of conventional computing to mak
e DNA computing reliable.

 EDNA includes graphical interfaces and click-and-drag fa

cilities to enable easy use.
 DNA Authentication
 Taiwan introduced the world's first DNA authenti
cation chip.

 Use of DNA chips on national identification cards

in order to crack down on frauds using fake ID c
ards. 
 The synthesized DNA inside the chip generates
DNA signals which only the company's readers c
an detect and authenticate in two seconds.
DNA Chip
 What developments can we exp
ect?
 Increased use of molecules other than DNA
 Some impact on molecular biology by DNA co
mputation
 Increased error avoidance and detection
 Cross-fertilization among DNA computing, mo
lecular biology, and computation biology
 Niche uses of DNA computers for problems th
at are difficult for electronic computers
 THANK YOU!!!

It will take years to develop a practical, workabl

e DNA computer.

But…Let’s all hope that this DREAM comes tru

e!!!

Done By…
J.N.V.B.Gangadhar