DNA Chip

(computing)

By:-
➢

MD. SARFARAZ (085418)

AVEEK MUKHERJEE (085419)
Definition:-

The DNA chip(bio chip) is a chip which

uses DNA as the basic building material
instead of silicon as is used today!
 What Is A DNA ?

> Source code to life

> Data store for genetic inheritance
 BASIC PRINCIPLE:
Complementary DNA strands stick together

●A is opposite toT
●G is opposite toC
Need of DNA based computer?

MOORE's Law!!
 Why Reduce nm?
Small channel length implies:-
 Less heat produced

 Faster movement of electrons

More compaction
 Basic Advantages:
 Cheap and readily available
 Bio degradable and environment friendly

Four storage bits A T G C




Supports huge parallelism
 How enormous is the
Parallelism
A test tube of DNA can contain trillions of strands. Each
operation on a test tube of DNA is carried out on all
strands in the tube in parallel !

Check this out……. We Typically use

300,000,000,000,000
molecules at a time
 But How 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.

Proposed by Adelman in 1994

 DNA as memory

1 g ra m o f D N A 1 X 1 140 M B!!

1 4 5 t r illio n C D s o f 8 0 0 M B ! !
 HAMILTONIAN PATH
PROBLEM

A p a th w h ic h c o v e rs a ll evxeartec tly
x
o n c ea n d g o e s th ro au llg hth e v e rtic e s
 Solving HPP with DNA
Kolkata

Delhi Mumbai

Madras

E d g e s a r e th e p a th s b e tw e e n th e c itie s
●

F in d a H a m ilto n ia n p a thK bOeLtwK eAeTanAn dM U M B A I

●
 S o lv in g H P P w it h D N A
• E n co d e th is g ra p h in a D N A
• Ve rtic e s a re a s sig n e d a ra n d o m D N A s e q u e
o K O L K ATA: ACTTGCAG
o M U M B A I: TCGGACTG
an d so on ...
Solving HPP with DNA(3)
F o rm in g E d g e s :
If DELHI is :ATCGGCAG and Mysore is G
: TACTAGC

D e lh i-M y s:o rAe T CGGC A G G TA

TACG C

C o m p l e m e n Ct G
i s T: C C AT G
 S o lv in g H P P w ith D
●
Use Polymerase Chain Reaction (PCR) to

replicate DNA with the correct start and end city

• Put one primer on KOLKATA and one primer on MUMBAI

• The right answer is replicated exponentially, while

the wrong paths are replicated linearly or not at all

Solving HPP with DNA (5)

●
Extract DNA s that are 4 city long :
Pass through gel matrix

● Cities only Once : Affinity purification

(rub tagged ball on DNA strands)

●DONE !!
 Past...Present
1994:Leonard M. Adleman, a University of Southern California
researcher,solved traveling salesman problem” using DNA in a test tube

 1997:University of Rochester researchers created simple Boolean logic

gates made from DNA.

2002:Scientists at the Weizmann Institute of Science in Israel unveiled a



working microprocessor made of protein structures and DNA molecules

2004:they engineered a computer made of single strands of DNA,which is



faster than the current fastest super computer



 2009: bio computing systems were coupled with standard silicon based
chips for the first time
 LIMITATIONS

● DNA computing involves a relatively large amount of error

● Requires human assistance!

● Time consuming laboratory procedures.

● No universal method of data representation.

Future Prospects &
Conclusion
Thank You
 Bibliography
http://computer.howstuffworks.com/dna-computer1.


http://www.intel.com/technology/architecture-silicon


http://www.physicsforums.com/showthread.php?t=1


http://en.wikipedia.org/wiki/Moore%27s_law


 http://en.wikipedia.org/wiki/DNA_computing