Presentation is loading. Please wait.

Presentation is loading. Please wait.

DNA Computation and Circuit Construction Isabel Vogt 2012.

Similar presentations


Presentation on theme: "DNA Computation and Circuit Construction Isabel Vogt 2012."— Presentation transcript:

1 DNA Computation and Circuit Construction Isabel Vogt 2012

2 What is computation? 2+2=4 RULE: 1 if and only if A=1 and B=1, else 0 ABOutput Computation

3 Computer Inputs Output

4 DeoxyriboNucleic Acid (DNA)

5 How can we engineer DNA to compute solutions to problems?

6 DNA Replication = Information Transfer

7

8 The Hamiltonian Path Problem A directed graph G with vertices v in and v out has a directed Hamiltonian path iff there exists a sequence of one-way edges e 1 …e i that begins at v in and ends at v out, and passes through every vertex exactly once. V in V out

9 1.Generate random paths through the graph 2.Keep only those paths that begin with v in and end with v out 3.If G has n vertices, keep only those paths that enter exactly n vertices 4.Keep only those paths that enter each vertex at least once 5.If any paths remain, say YES, if not NO

10 Parallel Computing With DNA

11 1.Generate random paths through the graph Unique 20mer for each vertex Unique 20mer for every existing edge Last 10mer of O i and first 10mer of O j Mix together for all vertices v i in G and for all edges e ij Splints for G-specific ligation Random Path through G

12 2.Keep only those paths that begin with v in and end with v out … … PCR copy region between (inclusive) and

13 3.If G has n vertices, keep only those paths that enter exactly n vertices MW 120mer Separate oligomers based upon size and keep only those of n(20) bases

14 4.Keep only those paths that enter each vertex at least once Pull down for every vertex

15 1.Generate random paths through the graph 2.Keep only those paths that begin with v in and end with v out 3.If G has n vertices, keep only those paths that enter exactly n vertices 4.Keep only those paths that enter each vertex at least once 5.If any paths remain, say YES, if not NO 1.Ligate G-specific paths through DNA hybridization 2.Run PCR with primers for and. 3.Separate oligomers on a gel and keep only those with length n(20) 4.Affinity chromatography for each vertex sequence 5.Amplify and run on a gel for a band

16 Truly parallel computation Applicability: – # oligomeric sequences grows linearly with # edges – Amount of oligomer scales exponentially Efficiency: – Approximately ligation reaction per second – ΔG ≈ -8 kcal mol -1 – 2 x reactions for 1 J – 2 nd Law of Thermodynamics: 34 x irreversible rxns per J The future of computation?

17

18 Branch Migration No Reaction Irreversible Reaction Reversible Reaction (see-sawing) Chen and Ellington. Curr Opin Biotech, 21: 2010

19 See-sawing Reporting Thresholding

20 S6* S6 T* S5* S5 T S6 S5 T S2 Input Gate Reporter

21 T* S5* S5 T S6 S5 T S2 S6* S6 T* Reporter

22 T* S5* S5 S6S5 T S2 T S6* S6 T* Reporter Output

23 S6* T* S5* S5 S6S5 T S2 Reporter T “Reporting”

24 T* S5* S5 S6S5 T S2 T S6* S6 T* Reporter Output

25 S6* S6 T* S5* S5 T S6 S5 T S2 Input Reporter “See-Sawing”

26 T* S5* S5 T S6 S5 T S2 Input Fueled see-sawing: catalytic output release S5 T S7 Gate:Output Fuel XS

27 Entropically Driven – back of the envelope calculation For Fuel strands catalyze complete release of output

28 T* S5* S5 T S6 S5 T S2 Input Thresholding: Limited output release Gate:Output Threshold 0.5 eq S2* T* S5* S5 Longer Toehold No Toehold

29 Threshold 0.5 eq S2* T* S5* S5 Longer Toehold No Toehold Irreversible preferential binding Rate increases exponentially with length of toehold sequence No toehold on the opposite side makes the reverse reaction negligible Zhang and Winfree. JACS,131: 2009

30

31 FAN OUT Single input If above threshold – catalytically releases all output FAN IN Many inputs Stoichiometrically releases single output

32

33 Dual-Rail Logic Makes use of two different sequences, one for ON and one for OFF Each OR, AND, ANDNOT, NAND, NOR gate is constructed by two gates Prevents computation before sequences are added

34 OR Gate OFF ON Add either x 0 or x 1 to indicate OFF or ON OR Gate: OR for ON (output = 1) or AND for OFF (output =0)

35

36 Why did this work? Simplicity Abstraction Tolerance Clamps Toehold length Temperature A lot of careful troubleshooting!

37 Why do we care? Functional, useful computers? Computation + DNA nanostructures See-sawing in RNAi and miRNAs? Regulation in an “RNA world”


Download ppt "DNA Computation and Circuit Construction Isabel Vogt 2012."

Similar presentations


Ads by Google