dna computing 101
TRANSCRIPT
-
8/8/2019 Dna Computing 101
1/20
DNADNA
COMPUTINGCOMPUTING
Presented by:Haripada dey Electrical engg.
Final year
-
8/8/2019 Dna Computing 101
2/20
OUT LINEOUT LINE
INTRODUCTION
-
8/8/2019 Dna Computing 101
3/20
INTRODUCTION INTRODUCTION Contemporary technology used for computing :- Silicon Based Semiconductor Technology
Upper Limits in Terms of Speed and Size Alternative Technology : DNA Computing or Molecular Computing.
DNA Computing :- Still an Emerging Field
-
8/8/2019 Dna Computing 101
4/20
BEYOND SILICON BEYOND SILICON
Moores Law : The Speed of Computing Chip will Double Roughly Every 18 months
Silicon Based Semiconductor Technology cant Sustain Moores Predictions.Physical Limits Posed By Silicon Based Technology
An Issue of Muller :- The Narrowest Feature of Semiconductor Device- The Gate-Oxide will Reach its Fundamental Physical Limits.
-
8/8/2019 Dna Computing 101
5/20
-
8/8/2019 Dna Computing 101
6/20
W hat is DNA Computing
W hat is DNA Computing ? ?
DNA and RNA computing (also
sometimes referred to as bio-molecular computing or molecular computing) is a new computational paradigm that harnesses biological molecules to solve computational problems.
-
8/8/2019 Dna Computing 101
7/20
W hat is DNA?
W hat is DNA?
DNA is Deoxyribonucleic Acid.
It is a Double-Stranded Helix of Nucleotides that Carries the genetic information of a cell.These Nucleotides consists of one of the 4 bases-Adenine(A), Thymine(T), Guanine(G),Cytosine(C). A pairs with T, G pairs with C.
-
8/8/2019 Dna Computing 101
8/20
-
8/8/2019 Dna Computing 101
9/20
-
8/8/2019 Dna Computing 101
10/20
Origins of DNA Computing Origins of DNA Computing Dr. Leonard Adleman : the Father of DNA Computing.
By using strands of DNA annealing to each other, he was able to compute a solution to an instance of the Hamiltonian path problem (HPP).
This is Also Known as The Travelling Salesman Problem(TSP).
-
8/8/2019 Dna Computing 101
11/20
-
8/8/2019 Dna Computing 101
12/20
Conditions Conditions The Path Must Start at City A and End at City E
Of Those Paths, The Correct Paths Must Pass Through All 5 Cities at Least Once.The Final Path(s) must Contain Each City in
Turn.
-
8/8/2019 Dna Computing 101
13/20
Advantages Of DNA Computers: Advantages Of DNA Computers:- - Unmatchable Speed Due To Inherent Parallelism 100 Times Faster Than Fastest Super Computer.Minimal Storage Requirement:- DNA stores Memory at a Density of About One Bit Per Cubic Nanometer.
-
8/8/2019 Dna Computing 101
14/20
Advantages: Advantages:- - Minimal Power Requirement : Because of
The Chemical Bonds.Clean, Cheap and Available.Suitable for Combinatorial Problems .
-
8/8/2019 Dna Computing 101
15/20
Disadvantages of DNA Computer Disadvantages of DNA Computer Occasionally Slow Hydrolysis : The DNA Molecules Can Fracture
-
8/8/2019 Dna Computing 101
16/20
COMPARISON OF DNA AND COMPARISON OF DNA AND CONVENTIONAL CONVENTIONAL
ELECTRONIC COMPUTERS ELECTRONIC COMPUTERS Similarities
Transformation of Data :-
Both Use Boolean Logic.Manipulation of Data :- Both Store Information in Strings.Computation Ability
-
8/8/2019 Dna Computing 101
17/20
Differences
Size Representation of Data : Base 4 For DNA Computers
Parallelism : DNA Computers inherently Parallel.Material
-
8/8/2019 Dna Computing 101
18/20
C ON C LUSIONC ON C LUSION
-
8/8/2019 Dna Computing 101
19/20
* THANK YOU
* * THANK YOU
*
QUERIES PLEASE ?
-
8/8/2019 Dna Computing 101
20/20
THANK YOUTHANK YOU