DNAcomputer1

8/7/2019 DNAcomputer1

1/19

1

Jyoti prava Badajena Roll:218L01

Computer Science & Engg.


2/19

2

TOPICS OF PRESENTATIONIntroduction.Biological preliminaries.Models of DNA computing.

Adleman s model.splicing systems.Insertion-Deletion systems.DNA-EC.

Advantages.Conclusion.References.


3/19

3

IntroductionDNAcomputer is a nanocomputer that usesDNA (Deoxy ribo nucleic acids)tostore informations and to performcomplex calculations.


4/19

4

Biological preliminariesDNA is a basic substance where the geneticinformations of all the livingbeings are

recorded. A Double helix molecule of DNA is a doublesequence of units called nucleotides.Four types of nucleotides differ in their

chemical groups called base ( A,G,T,C ) .complementary : A bonds only with T and Gbonds only with C during annealing.


5/19

5

DNA:A UNIQUE DATA

STRUCTUREThe bases are spaced every 0. 35

nanometers along the DNA molecule,giving DNA an remarkable data densityof nearly 18 Mbits per inch.In double stranded DNA ,data ismirrored on two drives, allowing data tobe recovered from the second drive if errors occur on the first.


6/19

6

Models of DNA computing

Adleman s model.Insertion-Deletion systems.splicing systems.

DNA-EC.

.


7/19

7

Adleman s Model

The first DNA computing modelsucessfully realized practically waspresented by Adleman in 199 4 .Gives solution to Hamiltonioan pathproblem.


8/19

8

ALGORITHM Algorithm used by Adleman to solve theproblem:

Given a graph G=(V,E)with n vertices andtwo vertices Vin & Vout V.Generate random paths through G.Keep only those paths that begins with Vinand ends in Vout.Keep only those paths that only enters nvertices.


9/19

9

ALGORITHMKeep only those paths that enter eachvertex atleast once .If any paths remain, the answer is yesotherwise no .


10/19

10

SPLICING SYSTEMSIn 198 7 Head introduced the splicing systemsto analyze the generative capcity of the

recombinant behaviour of DNA.Splicing rule is a word in the form of a#b$c#d.where a,b,c,d E*,

E*is generated by E consisting of allsequences obtained by catenating the lettersof E.


11/19


12/19

12

Example:

(X,Y) ->(Z,W)if X=X abX Z=X adX Y=Y cdY W=Y cbY

for some X and y.


13/19

13

INS-DEL SYSTEMIn 199 6 Kari and Thierrin introduced theinsertion-deletion system as a model of DNA.

Insertion:u(x,y)v={u1xyu2|u1,u2 E*,u1xvyu2}


14/19

14

DNA-ECThis model was proposed by Yokomori andkobyaschi.

It is based on equality checking.It performs two test operations .Emptiness test(EM):return yes if T

contains a string and no otherwise.Equivalence test(EQ):return yes if I(t)contains a double stranded string else

no .


15/19

15

Where T denotes a test tube containinga set of strings fixed over alphabet andI(T) be its containts.


16/19

16

Set operations:

Union: T UT I(T ) U I(T )Left cut: T=a\T I(T)={U|au I(T )}Left adding: T=aT I(T )={a}I(T )

Right adding:T=T a I(T )=I(T ){a}

Set operations:


17/19

17

ADVANTAGESHigh speed.

Energy efficiency.Economic information storing.Low rate of occurrence of error.


18/19

18

ADVANTAGES


19/19

19

ADVANTAGES

Documents

DNAcomputer1