MOLECULAR PROGRAMMING (in terms of the nuskell compiler project) - - PowerPoint PPT Presentation

molecular programming
SMART_READER_LITE
LIVE PREVIEW

MOLECULAR PROGRAMMING (in terms of the nuskell compiler project) - - PowerPoint PPT Presentation

REACTION ENUMERATION & CONDENSATION OF DOMAIN-LEVEL STRAND DISPLACEMENT SYSTEMS Stefan Badelt DNA and Natural Algorithms (DNA) Group, Caltech Feb , 2018 14 th 33rd TBI Winterseminar, Bled, Slovenia Grun, Badelt, Sarma, Shin, Wolfe, and


slide-1
SLIDE 1

1

REACTION ENUMERATION & CONDENSATION OF DOMAIN-LEVEL STRAND DISPLACEMENT SYSTEMS Stefan Badelt DNA and Natural Algorithms (DNA) Group, Caltech Feb , 2018 33rd TBI Winterseminar, Bled, Slovenia

14th

Grun, Badelt, Sarma, Shin, Wolfe, and Winfree (manuscript in preparation) http://www.github.com/DNA-and-Natural-Algorithms-Group/peppercornenumerator

slide-2
SLIDE 2

2

MOLECULAR PROGRAMMING

(in terms of the nuskell compiler project) nucleic acids are architecture to implement algorithms chemical reaction networks are a programming language formal/experimental verification of correct implementation

minimal/optimal components for biological systems biological relevance is primary if experiments fail, refine the method verifyably correct artificial systems formal description is primary, biological relevance secondary scalable, correct components arbitrary algorithm conditional switch information processing network

riboswitch protein coding region promoter region Terminator OFF Ligand riboswitch protein coding region promoter region Anti- Terminator ON + Ligand
  • Ligand
slide-3
SLIDE 3

3

DNA STRAND DISPLACEMENT

= Adenine = Thymine = Cytosine = Guanine = Phosphate backbone

DNA

= long domain = short domain

DNA

= 3' end = 5' end

b a* b* b b* a*

slide-4
SLIDE 4

4

DOMAIN-LEVEL STRAND DISPLACEMENT

a t x x t b x* t* t* x b t x t* t* x* t a x t* t* x* t a x b t x t b x* t* t* a t x x t b x* t* t* a t x bind 3-way branch migration unbind

A B F1 F2

short (toehold) domain: binds reversibly long (branch-migration) domain: binds irreversibly

+ +

i1 i2 i3

slide-5
SLIDE 5

5

DOMAIN-LEVEL STRAND DISPLACEMENT

a t x x t b x* t* t* x b t x t* t* x* t a x t* t* x* t a x b t x t b x* t* t* a t x x t b x* t* t* a t x bind 3-way branch migration unbind

A B F1 F2

short (toehold) domain: binds reversibly long (branch-migration) domain: binds irreversibly

+ +

i1 i2

detailed network condensed network

slide-6
SLIDE 6

6

DOMAIN-LEVEL STRAND DISPLACEMENT

a t x x t b x* t* t* x b t x t* t* x* t a x t* t* x* t a x b t x t b x* t* t* a t x x t b x* t* t* a t x bind 3-way branch migration unbind

A B F1 F2

short (toehold) domain: binds reversibly long (branch-migration) domain: binds irreversibly

+ +

i1 i2

detailed network condensed network

slide-7
SLIDE 7

7

DOMAIN-LEVEL STRAND DISPLACEMENT

a t x x t b x* t* t* x b t x t* t* x* t a

A B F1 F2

short (toehold) domain: binds reversibly long (branch-migration) domain: binds irreversibly

+ +

x t* t* x* t a x b t x t b x* t* t* a t x x t b x* t* t* a t x bind 3-way branch migration unbind

i1 i2 i3

formal CRN formal species: {A, B} DSD sytem specification signal species (low concentation): {A, B} fuel species (high concentration): {F1, F2}

slide-8
SLIDE 8

8

FROM CRN TO DSD SYSTEMS

Cardelli (2011) Soloveichik et al. (2010) Qian et al. (2011) Lakin et al. (2012)

Chen et al. (2012), Cardelli (2013), Srinivas (2015), Lakin et al. (2016), ...

Images drawn using VisualDSD, Lakin et al. (2012)

slide-9
SLIDE 9

9

FROM A DIGITAL CIRCUIT TO DSD

Qian et al. (2011)

Input for the nuskell compiler: 32 formal reactions. soloveichik2010.ts: 52 signal species, 92 fuel species, 172 intermediate species, 180 reactions. verifies as correct according to the pathway decomposition and CRN bisimulation equivalence Badelt, Johnson, Dong, Shin, Thachuk and Winfree: A general-purpose CRN-to-DSD compiler with formal verification, optimization, and simulation capabilities. LNCS (2017)

slide-10
SLIDE 10

10

REACTION TYPES

a b a* a*

a

b a* a a a* bind / open b a a* b* b a a* b* b

c c* c* c

3-way branch migration b

b b* a a* c* d* d a a* b b* c b b* a a* c c* d* d a a* b b*

4-way branch migration c* a* c c c* a* c c

slide-11
SLIDE 11

11

REACTION TYPES

  • pen & branch migration reactions are always

unimolecular, but may lead to dissociation. bind reactions are the only valid bimolecular reactions

  • pen reactions of domains with length > L are forbidden

allows all secondary structures (pseudoknots excluded)

a b a* a*

a

b a* a a a* bind / open b a a* b* b a a* b* b

c c* c* c

3-way branch migration b

b b* a a* c* d* d a a* b b* c b b* a a* c c* d* d a a* b b*

4-way branch migration c* a* c c c* a* c c

slide-12
SLIDE 12

12

a t t t* t* b A B

slide-13
SLIDE 13

13

a t t t* t* b A B a t t t* t* b

slide-14
SLIDE 14

14

a t t t* t* b A B a t t t* t* b a t t

slide-15
SLIDE 15

15

a t t t* t* b A B a t t t* t* b a t t t* t* b

slide-16
SLIDE 16

16

a t t t* t* b A B a t t t* t* b a t t t* t* b ?

slide-17
SLIDE 17

17

a t t t* t* b A B a t t t* t* b a t t t* t* b ? t a t + t* b t* + t a t + t* b t* . . ( + ( . . + ) . ( + ) . )

slide-18
SLIDE 18

18

a t t t* t* b A B a t t t* t* b a t t t* t* b ? t a t + t* b t* + t a t + t* b t* . . ( + ( . . + ) . ( + ) . )

x

multistranded pseudoknot

slide-19
SLIDE 19

19

SEPARATION OF TIMESCALES

unimolecular reactions are fast bimolecular reactions are slow

a t t t* t* b A B a t t t* t* b kα kβ + transient complex resting complexes X

{X A + B; A + B X} −→

− →

at low concentrations:

[A][B] << [X] kβ kα

slide-20
SLIDE 20

20

MODEL PARAMETERS

rate-independent model

  • pen reactions where domain-length

are negligible unimolecular reactions are fast bimolecular reactions are slow

> L

rate-dependent model assume typical rate constant for every reaction: = rate(rtype, dlength) unimolecular reactions with are negligible unimolecular reactions with are slow unimolecular reactions with are fast bimolecular reactions are slow

k k < kslow k < kfast k ≥ kfast

slide-21
SLIDE 21

21

valid according to enumeration semantics:

REACTION ENUMERATION

every complex has all valid fast reactions enumerated transient complexes have no slow reactions enumerated resting complexes have all valid slow reactions enumerated all initial complexes are included all valid, except open max-helix semantics: reaction types are greedy probability threshold for reactants of bimolecular reactions. probability threshold for products of unimolecular reactions.

> L

slide-22
SLIDE 22

22

CRN CONDENSATION Goal: represent CRN in terms of overall slow reactions

all fast reactions are unimolecular reactions have arity (n,m) with n > 0 and m > 0 reactants of slow reactions must be resting states reactants and products of fast (1-2) reactions are in different SCCs (mass conservation)

properties / requirements:

slide-23
SLIDE 23

23

CRN CONDENSATION Step 1: Make a graph that contains only fast (1,1) reactions

slide-24
SLIDE 24

24

CRN CONDENSATION Step 2: Identify strongly connected components (SCCs)

slide-25
SLIDE 25

25

CRN CONDENSATION Step 3: Define transient and resting macrostates

C D E F A B

slide-26
SLIDE 26

26

CRN CONDENSATION Step 4: Assign fates to complexes (or macrostates)

slide-27
SLIDE 27

27

CRN CONDENSATION Step 5: Insert slow reactions & derive condensed reactions

slide-28
SLIDE 28

28

DSD CONDENSATION

a t x

A

x t b x* t* t*

F1

x t* t* x* t a

F2

x t b x* t* t* a t x

i1

x t* t* x* t a x b t

i2

x t* t* x* t a a x t

i4

x t b x* t* t* x t b

i3

x b t

B

{(A+F2)} {(B+F1)} {(A)} {(F1)} {(B)} {(F2)} {(A+F1), (B+F2)} fast (1,1) reaction fast (1,2) reaction slow (2,1) reaction resting macrostate transient macrostate

{}

set of fates

condensed reactions:

A + F1 -> B + F2 B + F2 -> A + F1

detailed reactions:

A + F1 -> i1 i1 -> i2 i2 -> B + F2 B + F2 -> i2 i2 -> i1 i1 -> A + F1 A + F2 -> i4 i4 -> A + F2 B + F1 -> i3 i3 -> B + F1

slide-29
SLIDE 29

29

REACTION RATE CONDENSATION

Consider a condensed reaction:

P + Q K + L + M →

It is composed of all detailed slow reactions: weighted by the decay probability over all pathways:

p + q I → I → ⋯ → k + l + m

where and is a multiset of intermediate species

p ∈ P, q ∈ Q, k ∈ K, l ∈ L, m ∈ M I

slide-30
SLIDE 30

30

REACTION RATE CONDENSATION

microstate (complex) fast (1,1) reaction slow (1,1) reaction fast (1,2) reaction slow (2,1) reaction resting macrostate transient macrostate

{}

set of fates

detailed reaction: condensed reaction:

Notation: given: define: then the condensed rate is:

slide-31
SLIDE 31

31

REACTION RATE CONDENSATION

general form:

= ⋅ ℙ[ ] ⋅ ℙ[ : ] kr̂ ∑

r=(A,B)∈RÂ

kr TB→B̂ ∏

∈A ai

ai Â

i

where stationary distribution reaction decay probability

ℙ[ : ] = ai Â

i

ℙ[ ] = TB→B̂

slide-32
SLIDE 32

32

A DNA OSCIALLATOR

Srinivas, Parkin, Seelig, Winfree, Soloveichik: Enzyme-free nucleic acid dynamical systems. Science (2017)

slide-33
SLIDE 33

33

A DNA OSCIALLATOR

Srinivas, Parkin, Seelig, Winfree, Soloveichik: Enzyme-free nucleic acid dynamical systems. Science (2017)

slide-34
SLIDE 34

34

DETAILED VS. CONDENSED SIMULATION

translation scheme: srinivas2017.ts

slide-35
SLIDE 35

35

REACTION ENUMERATOR

model limitations no multistranded pseudoknots assumption of low concentrations assumption of "typical" reaction rate constants model parameters multiple layers of reaction-semantics reaction types max-helix notion (representation-independent) reaction rate dependent enumeration

slide-36
SLIDE 36

36

What the domain level can do: enumerate intended reaction pathways detect unintended reaction pathways very fast assessment of overall dynamics define a CRN for sequence-level simulations What the domain level cannot do: include sequence-level variations within the domains What the domain level could do: detect and quantify particular leak reactions provide a coarse-graining for stochastic simulations

slide-37
SLIDE 37

37

THANKS TO

Erik Winfree Casey Grun Karthik Sarma Seung Woo Shin you Brian Wolfe

http://www.github.com/DNA-and-Natural-Algorithms-Group/peppercornenumerator This research was funded in parts by: The Caltech Biology and Biological Engineering Division Fellowship. The U.S. National Science Foundation NSF Grant CCF-1213127 and NSF Grant CCF-1317694. The Gordon and Betty Moore Foundation's Programmable Molecular Technology Initiative (PMTI).