DNA Computing: Ch. Lakshmi Lavanya 06D21A0419 Ece-A

DNA
COMPUTING
BY
CH. LAKSHMI LAVANYA

06D21A0419
ECE-A
DNA COMPUTING
 Considering Moore’s law…
 Silicon has limitations….
 It is a molecular
computing, a new approach
 Computation using DNA”

but not “computation on
DNA
CAN DNA COMPUTE ..??
DNA itself does not carry out

any computation.
 It rather acts as a massive

memory.
BUT, the way complementary

bases react with each other can
be used to compute things.
STRUCTURE OF DNA
 Composed of four
nucleotides (+ sugar-
phosphate backbone)
A – Adenine
T –Thymine
C – Cytosine
G – Guanine
INTRESTING FACTS
DNA molecule is 1.7meters
long
DNA is the basic medium

of information storage for
all living cells.
Stretch out the entire DNA

in your cells and you could
reach the moon 6000 times!
Where it all started..??
 Started by Leonard M. Adleman,
a professor of Computer Science at
USC utilized recombinant DNA to
solve a simple “Traveling Salesman
Problem."
Travelling Salesman Problem
Let us consider 6 cities.. Darwin
Perth
Perth Alice Spring Brisbane
Darwin
Alice spring
Sydney
Brisbane
Melbourne
Sydney
Melbourne
ALOGORITHM…
ADLEMAN’S APPROACH …
Generate all possible routes
Select paths that start with the proper city

and end with the final city
Select paths with the correct number of cities
Select paths that contain each city only once

Adleman’s Experiment
No deterministic solution…
Solution by inspection is:

Darwin  Brisbane  Sydney  Melbourne  Perth
 Alice Spring
Darwin
Brisbane
Perth
Alice Spring
Sydney
Melbourne
Adleman’s Experiment (Cont’d)
1. Encode each city with complementary

base - vertex molecules
Sydney – TTAAGG
Perth – AAAGGG
Melbourne – GATACT
Brisbane – CGGTGC
Alice Spring – CGTCCA
Darwin - CCGATG
2. Encode all possible paths using the

complementary base – edge molecules
Sydney  Melbourne – AGGGAT
Melbourne  Sydney – ACTTTA
Melbourne  Perth – ACTGGG
etc…
3. The solution is a double helix molecule:
Darwin Brisbane Sydney Melbourne Perth Alice Spring

CCGATG – CGGTGC – TTAAGG – GATACT – AAAGGG – CGTCCA
TACGCC – ACGAAT – TCCCTA – TGATTT – CCCGCA

Darwin Brisbane Sydney Melbourne Perth
Brisbane Sydney Melbourne Perth Alice Spring
OPERATIONS ON TUBE
 SEPERATE •Tube T, string S {A,C,G,T}
••+(T,S)___All
Tubes T1, T2 the molecules in T
containing S
 MERGE Given a tube T, say yes if T
•U(T1, T2) = T1 U T2
•contains at least
-(T,S)___All one DNA
the molecules in T not
molecule,Sand say no if it
containing
 DETECT contains none.
FIRST DNA COMPUTER..
•Tokyo (July 3rd, 2002)
• Olympus Optical Co. Ltd.
•Specializes in gene analysis.
•Standard gene analysis

approach is time consuming
(3 days)
• Now done in 6hrs

CONVENTIONAL COMPUTER vs DNA COMPUTER
SIZE
Adleman dubbed his DNA computer the TT-100,
about one- fiftieth of a teaspoon of fluid.
SPEED
 Conventional computers can perform approx 100
MIPS.
 DNA computer -100 times faster than the fastest
computer.
CONVENTIONAL COMPUTER vs DNA COMPUTER
MINIMAL STORAGE REQUIREMENT
 DNA requires 1 bit per cubic nanometer.

 conventional storage media -10^12 cubic
nanometers
POWER REQUIREMENT
 No power is required for DNA computing.
APPLICATIONS
 DNA SEQUENCING
 DNA FINGER PRINTING
 DNA MUTATION DETECTION
 DATA ENCRIPTION
PROS…
Generate a complete set of potential solutions.

Conduct large parallel searches.
Efficiently handle massive amounts of working memory.
Effectively doubling of capacity to store information.
Perform millions of operations simultaneously.
CONS…
Requires constant supply of proteins and enzymes.
Occurrence of errors.
Application specific
Manual intervention by human is required

FUTURE OF DNA COMPUTING
Current Trends
Surface DNA Techniques

2011 – The first DNA chip will be commercially
available
Huge advances in biotechnology
DNA sequencing
Faster analysis techniques : DNA chips
CONCLUSION
•Many issues to be overcome to produce a useful

DNA computer.
•It will not replace the current computers because

it is application specific, but has a potential to
replace the high-end research oriented
computers in future.
ANY QUERIES …??

DNA Computing: Ch. Lakshmi Lavanya 06D21A0419 Ece-A

Uploaded by

Copyright:

Available Formats

DNA Computing: Ch. Lakshmi Lavanya 06D21A0419 Ece-A

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DNA Computing: Ch. Lakshmi Lavanya 06D21A0419 Ece-A

Uploaded by

Copyright:

Available Formats

DNA

CH. LAKSHMI LAVANYA

 Considering Moore’s law…

 Silicon has limitations….

 Computation using DNA”

DNA itself does not carry out

 It rather acts as a massive

BUT, the way complementary

DNA is the basic medium

Stretch out the entire DNA

Let us consider 6 cities.. Darwin

Generate all possible routes

Select paths that start with the proper city

Select paths with the correct number of cities

Select paths that contain each city only once

Solution by inspection is:

1. Encode each city with complementary

2. Encode all possible paths using the

3. The solution is a double helix molecule:

Darwin Brisbane Sydney Melbourne Perth Alice Spring

TACGCC – ACGAAT – TCCCTA – TGATTT – CCCGCA

 SEPERATE •Tube T, string S {A,C,G,T}

•Tokyo (July 3rd, 2002)

• Olympus Optical Co. Ltd.

•Specializes in gene analysis.

•Standard gene analysis

• Now done in 6hrs

MINIMAL STORAGE REQUIREMENT

 DNA requires 1 bit per cubic nanometer.

Generate a complete set of potential solutions.

Requires constant supply of proteins and enzymes.

Manual intervention by human is required

Surface DNA Techniques

Huge advances in biotechnology

•Many issues to be overcome to produce a useful

•It will not replace the current computers because

You might also like