Professional Documents
Culture Documents
Shashwat Shriparv
dwivedishashwat@gmail.com
InfinitySoft
Introduction
3
DNA MEMORY
A DNA string can be viewed as a memory resource to
save info:
4 types of units (A,C,G,T)
Complementary units: A-T,C-G
4
Uniqueness of DNA
Enormous parallelism.
5
Dense Information Storage
This image shows 1 gram of
DNA on a CD. The CD can
hold 800 MB of data.
6
DNA Computing
7
Computers Vs DNA computing
8
Why do we investigate about “other”
computers?
Certain types of problems (learning, pattern
recognition, fault-tolerant system, large set searches,
cost optimization) are intrinsically very difficult to
solve with current computers and algorithms
9
Adleman’s solution of the Hamiltonian
Directed Path Problem(HDPP).
11
An example of NP-problem: the
Traveling Salesman Problem
1. Code each city (node) as an 8 unit DNA string
12
Coding the paths
(Hybridization and ligation between city molecules and intercity link molecules )
1, Atlanta – Boston:
ACTTGCAGTCGGACTG
|||||||| Solution A+B+C+D:
CGTCAGCC
R:(GCAGTCGG)
2,(A+B)+Chicago: ACTTGCAGTCGGACTGGGCTATGTCCGAGCAA
ACTTGCAGTCGGACTGGGCTATGT
||||||||
TGACCCGA R:(ACTGGGCT) 13
Filter the correct solutions
14
Algorithm
16
Advantages
No toxic by-products.
Time consuming.
Occasionally slower.
Reliability.
Human Assistance.
Danger of Errors possible
Undesired annealings.
19
Error Restrictions
20
Applications
22
Future!
23
THANK YOU
Shashwat Shriparv
dwivedishashwat@gmail.com
InfinitySoft
24