Localized DNA Circuits Hieu Bui 1. Outline  Localized Kinetics & Modelling  Localized Hybridization Reactions  On Nanotracks  On DNA Origami 2.

Slides:



Advertisements
Similar presentations
Z34Bio: A Framework for Analyzing Biological Computation
Advertisements

Design and analysis of DNA strand displacement devices using probabilistic model checking by Matthew R. Lakin, David Parker, Luca Cardelli, Marta Kwiatkowska,
Design of a biomolecular Device that executes process Algebra Urmi Majumder and John Reif Department of Computer Science Duke University DNA15, JUNE 10,
Transfer FAS UAS SAINT-PETERSBURG STATE UNIVERSITY COMPUTATIONAL PHYSICS Introduction Physical basis Molecular dynamics Temperature and thermostat Numerical.
Simulation of Prokaryotic Genetic Circuits Jonny Wells and Jimmy Bai.
Adaptive Control of a Multi-Bias S-Parameter Measurement System Dr Cornell van Niekerk Microwave Components Group University of Stellebosch South Africa.
Variants of Stochastic Simulation Algorithm Henry Ato Ogoe Department of Computer Science Åbo Akademi University.
H IGH -F IDELITY DNA H YBRIDIZATION USING P ROGRAMMABLE M OLECULAR DNA D EVICES Nikhil Gopalkrishnan, Harish Chandran & John Reif.
Outline Formulation of Filtering Problem General Conditions for Filtering Equation Filtering Model for Reflecting Diffusions Wong-Zakai Approximation.
Petri net modeling of biological networks Claudine Chaouiya.
Digital Signal Processing with Biomolecular Reactions Hua Jiang, Aleksandra Kharam, Marc Riedel, and Keshab Parhi Electrical and Computer Engineering University.
Phillip Senum University of Minnesota. Motivation Much effort has been spent developing techniques for analyzing existing chemical systems. Comparatively.
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
1 Markov Chains Tom Finke. 2 Overview Outline of presentation The Markov chain model –Description and solution of simplest chain –Study of steady state.
May 14, ISVLSI 09 Algorithms for Estimating Number of Glitches and Dynamic Power in CMOS Circuits with Delay Variations Jins Davis Alexander Vishwani.
CSE 3504: Probabilistic Analysis of Computer Systems Topics covered: Continuous time Markov chains (Sec )
Enhanced Dual-Transition Probabilistic Power Estimation with Selective Supergate Analysis Fei Huand Vishwani D. Agrawal Department of ECE, Auburn University,
Graphical Models for Protein Kinetics Nina Singhal CS374 Presentation Nov. 1, 2005.
Estimating recombination rates using three-site likelihoods Jeff Wall Program in Molecular and Computational Biology, USC.
Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion Mehmet Serkan Apaydin, Douglas L. Brutlag, Carlos.
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
PCR Primer Design Guidelines
Modeling molecular dynamics from simulations Nina Singhal Hinrichs Departments of Computer Science and Statistics University of Chicago January 28, 2009.
Stochastic models of chemical kinetics 5. Poisson process.
1 EE381V: Genomic Signal Processing Lecture #13. 2 The Course So Far Gene finding DNA Genome assembly Regulatory motif discovery Comparative genomics.
Planning and Verification for Stochastic Processes with Asynchronous Events Håkan L. S. Younes Carnegie Mellon University.
Ketan Patel, Igor Markov, John Hayes {knpatel, imarkov, University of Michigan Abstract Circuit reliability is an increasingly important.
ChE 452 Lecture 24 Reactions As Collisions 1. According To Collision Theory 2 (Equation 7.10)
Scientific Computing Topics for Final Projects Dr. Guy Tel-Zur Version 2,
Beyond Silicon: Tackling the Unsolvable with DNA.
Research, Development, Consulting, Training High Fidelity Modeling and Simulation Where we are going… …future plans.
Chicago, July 22-23, 2002DARPA Simbiosys Review 1 Monte Carlo Particle Simulation of Ionic Channels Trudy van der Straaten Umberto Ravaioli Beckman Institute.
Jeffrey Zheng School of Software, Yunnan University August 4, nd International Summit on Integrative Biology August 4-5, 2014 Chicago, USA.
1 Modeling and Simulation International Technology Roadmap for Semiconductors, 2004 Update Ashwini Ujjinamatada Course: CMPE 640 Date: December 05, 2005.
Biomolecular Computation in Virtual Test Tubes 7 th International Meeting on DNA Based Computers, p75-83, June 10-13, 2001 Max Garzon, Chris Oehmen Summarized.
Marc D. Riedel Associate Professor, ECE University of Minnesota EE 5393: Circuits, Computation and Biology ORAND.
Horn Clause Computation by Self-Assembly of DNA Molecules Hiroki Uejima Masami Hagiya Satoshi Kobayashi.
Parallel & Distributed Systems and Algorithms for Inference of Large Phylogenetic Trees with Maximum Likelihood Alexandros Stamatakis LRR TU München Contact:
Denaturation temperatuare gradient- polymerase chain reaction: by-product? Ji Youn Lee Cell and microbial engineering laboratory Seoul National University.
Hardware Accelerator for Combinatorial Optimization Fujian Li Advisor: Dr. Areibi.
Molecular Modelling - Lecture 2 Techniques for Conformational Sampling Uses CHARMM force field Written in C++
Whiplash PCR History: - Invented by Hagiya et all 1997] - Improved by Erik Winfree Made Isothermal by John Reif and Urmi Majumder 2008 Whiplash.
Computational and experimental analysis of DNA shuffling : Supporting text N. Maheshri and D. V. Schaffer PNAS, vol. 100, no. 6, Summarized by.
A Software Tool for Generating Non-Crosshybridizing libraries of DNA Oligonucleotides Russell Deaton, junghuei Chen, hong Bi, and John A. Rose Summerized.
John Reif and Urmi Majumder Department of Computer Science Duke University Isothermal Reactivating Whiplash PCR for Locally Programmable Molecular Computation.
Types of Models Marti Blad Northern Arizona University College of Engineering & Technology.
TileSoft: Sequence Optimization Software for Designing DNA Secondary Structures P. Yin*, B. Guo*, C. Belmore*, W. Palmeri*, E. Winfree †, T. H. LaBean*
Sayed Ahmad Salehi Marc D. Riedel Keshab K. Parhi University of Minnesota, USA Markov Chain Computations using Molecular Reactions 1.
An Introduction to Simulated Annealing Kevin Cannons November 24, 2005.
Towards Autonomous Molecular Computers Towards Autonomous Molecular Computers Masami Hagiya, Proceedings of GP, Nakjung Choi
Polymerase Chain Reaction: A Markov Process Approach Mikhail V. Velikanov et al. J. theor. Biol Summarized by 임희웅
Biomolecular implementation of linear I/O systems Lecture 4/7/2016 Oishi, Kazuaki, and Eric Klavins. "Biomolecular implementation of linear I/O systems."
Polymerase Chain Reaction
Hybrid Cloud Architecture for Software-as-a-Service Provider to Achieve Higher Privacy and Decrease Securiity Concerns about Cloud Computing P. Reinhold.
Modeling molecular dynamics from simulations
Monte Carlo methods 10/20/11.
David Van Valen, Mikko Haataja, Rob Phillips  Biophysical Journal 
PNA-mediated Whiplash PCR
DO NOW Get out Reaction Mechanism Practice. Pick up review.
Fuzzy logic with biomolecules
ELE 523E COMPUTATIONAL NANOELECTRONICS
V. Chan, D. J. Graves, and S. E. McKenzie
Large Time Scale Molecular Paths Using Least Action.
KINETICS CONTINUED.
Fitness measures for DNA Computing
Johann Biedermann, Alexander Ullrich, Johannes Schöneberg, Frank Noé 
DNA computing on surfaces
International Workshop
Chapter-5 Traffic Engineering.
Volume 102, Issue 5, Pages (March 2012)
Presentation transcript:

Localized DNA Circuits Hieu Bui 1

Outline  Localized Kinetics & Modelling  Localized Hybridization Reactions  On Nanotracks  On DNA Origami 2

References 3  N. Dalchau, H. Chandran, N. Gopalkrishnan, A. Phillips, J. Reif, Probabilistic Analysis of Localized DNA Hybridization Circuits. Acs Synth Biol 4, (2015).  H. Bui, S. Garg, R. Mokhtar, T. Song, J.Reif, Localized Cascade DNA Hybridization Chain Reactions of DNA Hairpins on a DNA Track.  H. Chandran, N. Gopalkrishnan, A. Phillips, J. Reif, Localized Hybridization Circuits. Lect Notes Comput Sc 6937, (2011).  M. R. Lakin, R. Petersen, K. E. Gray, A. Phillips, in Lect Notes Comput Sc. (Springer, 2014), pp  M. Teichmann, E. Kopperger, F. C. Simmel, Robustness of Localized DNA Strand Displacement Cascades. Acs Nano, (2014).  J. Elezgaray et al., Connecting Localized DNA Strand Displacement Reactions. Nanoscale, (2015).  E. Kopperger, T. Pirzer, F. C. Simmel, Diffusive transport of molecular cargo tethered to a DNA origami platform. Nano letters 15, (2015).

Objective  Challenges from programing DSD devices:  Speed  Scalability  Spurious interactions/crosstalk  What are the current options?  Sequence design (mismatch, clamp, G-C)  Lower concentration  Developing software  to ease the sequence design process  to track all possible reaction pathways  Programming DSD devices on 2D surface 4

A Biophysical Model 5 Local concentration estimation: Distance between molecules Flexibility of DNA Length of molecules

Software: How to solve it?  Visual DSD:  To design and analyze DNA strand displacement systems in solution-phase.  Not applicable for 2D DNA circuits.  Need to employ continuous-time Markov chain (CTMC) to be relevant.  PRISM:  To test logical queries by probabilistic model checking. 6

 Integrate probabilistic model checking within Visual DSD.  Streamline approach to analyze modifications to a given model.  Optimize the computation of probabilistic queries at multiple time points. Visual DSD PRISM 7

How to calculate transient probabilities?  PRISM:  Uniformization method: a discrete time conversion of CTMC to calculate the probability of being in a particular state at a particular time.  High setup cost when requesting multiple time points.  More efficient and stable routine for single calculations.  Visual DSD  Numerical integration of the chemical master equation (CME).  Propagate the solution at a previous time point to the next one.  Low setup cost when requesting multiple time points.  Consume large memory to store multiple time points. 8

Chemical Master Equations (CME)  Distribution of all possible trajectories.  Analysis of CME:  Generate a CTMC (full state space of the system).  Each state – a vector of species populations.  Each position – a separate species.  Examples:  Global setting: N species and 1000 copies of each species: state space of 1000 N.  Localized setting: N species and a single copy of each species (present or absent), state space of 2 N. 9

 The state space is O(c N ) for N distinct species. (c = 2)  The state space is O(c N ) for N distinct species (c = 1000). 10

Visual DSD  To simulate the localized strand displacement circuit:  Generate a CTMC (a detailed mode and an infinite mode).  Transition rates 11

12

Designed Localized Circuits 13

Implementing OR 14

Implementing OR 15

Implementing AND 16

Implementing FANOUT 17

More Complex Circuits 18

More Complex Circuits 19

Simulating Biophysical Model 20

21

Localized Hybridization Reactions on Nanotracks 22

23

Experimental Data: Speedup 24

Experimental Data 25

Experimental Data: Concentration Test 26

27 Localized Hybridization Reactions on DNA Origami

224 x 2 binding sites 28 √ √ √ √ √ √ √ √

Consideration  Staples are missing 7% of the time.  75% of 4 gates to be formed.  Built-in redundancy.  Consensus methods.  Hairpins interacting during anneal processes.  Hairpin structure is stable at a higher temperature. 29

Abstract Modelling of Tethered DNA Circuits 30

Robustness of Localized DNA Strand Displacement Cascades 31

Connecting Localized DNA Strand Displacement Reactions 32

Diffusive transport of molecular cargo tethered to a DNA origami platform 33