Z34Bio: A Framework for Analyzing Biological Computation

Slides:



Advertisements
Similar presentations
1 Verification by Model Checking. 2 Part 1 : Motivation.
Advertisements

Analysis of Computer Algorithms
Sugar 2.0 Formal Specification Language D ana F isman 1,2 Cindy Eisner 1 1 IBM Haifa Research Laboratory 1 IBM Haifa Research Laboratory 2 Weizmann Institute.
Chapter 4 Computation Bjarne Stroustrup
U Computer Systems Research: Past and Future u Butler Lampson u People have been inventing new ideas in computer systems for nearly four decades, usually.
An Adaptive Affective Social Decision Making Model Alexei Sharpanskykh Jan Treur vrije Universiteit amsterdam.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Interference.
T. Nakano. , A. Enomoto. , M. Moore. , R. Egashira. , T. Suda. , K
5. Model Checking Modellbasierte Softwareentwicklung
Power Conscious Test Synthesis and Scheduling for BIST RTL Data Paths Nicola Nicolici and Bashir M. Al-Hashimi.
Lexical Analysis Dragon Book: chapter 3.
1 Abstraction (Cont’d) Defining an Abstract Domain variable elimination, data abstraction, predicate abstraction Abstraction for Universal/Existential.
Tanmoy Sarkar, Johnny Wong, Samik Basu Response to Collaborative Attacks Against Network Vulnerability Iowa State University, Department Of Computer Science.
Auto-Generation of Test Cases for Infinite States Reactive Systems Based on Symbolic Execution and Formula Rewriting Donghuo Chen School of Computer Science.
Intervenant - date Requirement Refinement to Test Case Generation for Embedded Railway Control Systems by : Ying YANG 09/06/2011 Ph.D Student French institute.
Robustness Analysis and Tuning of Synthetic Gene Networks Grégory Batt Center for Information and Systems Engineering and Center for BioDynamics Boston.
Chapter #8: Finite State Machine Design Contemporary Logic Design
Robustness Analysis and Tuning of Synthetic Gene Networks Grégory Batt 1 Boyan Yordanov 1 Calin Belta 1 Ron Weiss 2 1 Centers for Information and Systems.
R OBUSTNESS ANALYSIS AND TUNING OF SYNTHETIC GENE NETWORKS Grégory Batt, Boyan Yordanov, Ron Weiss, and Calin Belta 1 VC Lab, Dept. of Computer Science,
Génération de jeux de test pour les programmes de règles 1 er juillet 2009 ILOG Chair of Software Engineering Freiburg Universität Bruno Berstel
Chapter 4 Gates and Circuits.
Gates and Circuits Nell Dale & John Lewis (adaptation by Erin Chambers and Michael Goldwasser)
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
1 Computer Programming Boolean Logic Copyright © Texas Education Agency, 2013.
Chapter 3 Digital Logic Structures
INTRODUCTION LOGICAL OPERATIONS TRUTH TABLE AND RULES.
A New Recombination Lower Bound and The Minimum Perfect Phylogenetic Forest Problem Yufeng Wu and Dan Gusfield UC Davis COCOON07 July 16, 2007.
Chapter 4 Gates and Circuits.
Chapter #8: Finite State Machine Design 8
4 If-Statements © 2010 David A Watt, University of Glasgow Accelerated Programming 2 Part I: Python Programming.
1 Testing Stochastic Processes Through Reinforcement Learning François Laviolette Sami Zhioua Nips-Workshop December 9 th, 2006 Josée Desharnais.
CSTA K-12 Computer Science Standards (rev 2011)
Jan SedmidubskyOctober 28, 2011Scalability and Robustness in a Self-organizing Retrieval System Jan Sedmidubsky Vlastislav Dohnal Pavel Zezula On Investigating.
A Micro-benchmark Suite for AMD GPUs Ryan Taylor Xiaoming Li.
Compiler Construction LR(1) Rina Zviel-Girshin and Ohad Shacham School of Computer Science Tel-Aviv University.
Finite State Machines Finite state machines with output
Delta-Oriented Testing for Finite State Machines
Scalable Rule Management for Data Centers Masoud Moshref, Minlan Yu, Abhishek Sharma, Ramesh Govindan 4/3/2013.
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
Timed Automata.
SBML2Murphi: a Translator from a Biology Markup Language to Murphy Andrea Romei Ciclo di Seminari su Model Checking Dipartimento di Informatica Università.
Robustness analysis and tuning of synthetic gene networks February 15, 2008 Eyad Lababidi Based on the paper “Robustness analysis and tuning of synthetic.
System Biology Study Group Walker Research Group Spring 2007.
Models and methods in systems biology Daniel Kluesing Algorithms in Biology Spring 2009.
Formal Methods 1. Software Engineering and Formal Methods  Every software engineering methodology is based on a recommended development process  proceeding.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
DNA Computing on a Chip Mitsunori Ogihara and Animesh Ray Nature, vol. 403, pp Cho, Dong-Yeon.
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
Reconstruction of Transcriptional Regulatory Networks
Model Based Testing Group 7  Nishanth Chandradas ( )  George Stavrinides ( )  Jeyhan Hizli ( )  Talvinder Judge ( )  Saajan.
Cellular Automata & DNA Computing 우정철. Definition Of Cellular Automata Von Von Neuman’s Neuman’s Definition Wolfram’s Wolfram’s Definition Lyman.
Modeling the Chemical Reactions Involved in Biological Digital Inverters Rick Corley Mentor: Geo Homsy.
Jehoshua (Shuki) Bruck. From Screws to Systems… The Lineage of BMW.
Marc D. Riedel Associate Professor, ECE University of Minnesota EE 5393: Circuits, Computation and Biology ORAND.
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
Computer Science 101 Theory of Computing. Computer Science is... The study of algorithms, with respect to –their formal properties –their linguistic realizations.
- 1 -  P. Marwedel, Univ. Dortmund, Informatik 12, 05/06 Universität Dortmund Validation - Formal verification -
Sayed Ahmad Salehi Marc D. Riedel Keshab K. Parhi University of Minnesota, USA Markov Chain Computations using Molecular Reactions 1.
Teaching Bioinformatics Nevena Ackovska Ana Madevska - Bogdanova.
Biomolecular implementation of linear I/O systems Lecture 4/7/2016 Oishi, Kazuaki, and Eric Klavins. "Biomolecular implementation of linear I/O systems."
Localized DNA Circuits Hieu Bui 1. Outline  Localized Kinetics & Modelling  Localized Hybridization Reactions  On Nanotracks  On DNA Origami 2.
Sub-fields of computer science. Sub-fields of computer science.
ELE 523E COMPUTATIONAL NANOELECTRONICS
Lecture 20: Combinatorial Circuits I
Department of Computer Science Abdul Wali Khan University Mardan
Introductory Concepts
Computational Biology
Lecture One: Automata Theory Amjad Ali
Presentation transcript:

Z34Bio: A Framework for Analyzing Biological Computation Boyan Yordanov, Christoph M. Wintersteiger, Youssef Hamadi, and Hillel Kugler SMT 2013, Helsinki

Exposing Biology to the Formal Methods Community and Vice Versa DSD GEC Biocharts Varna … Simulators Biological Modelling Engine Z34Bio SMT http://rise4fun.com/z34biology

Questions that we cannot (fully) answer yet ara NRI 1 pBad gfp 2 glnAp2 4 CI LacI ? 6 Synthetic Biology – How to design biological systems with desired behavior from parts? Stem Cells – what is a stem cell computing to maintain its state, and can we program stem cells to acquire specific fates in a robust way? Developmental Biology – what are the design principles of organ development and maintenance? DNA Computing – Is our designed circuit computing what we expected?

Boolean Networks bool A, B, C; while (true) { A = f(A, B, C); B = g(A, B, C); C = h(A, B, C); } Boolean Functions

Boolean Networks A C B AND OR 000 100 001 101 011 010 111 110 A,B,C

Drosophila melanogaster BN (Fruit Fly)

Chemical Reaction Networks while (true) { switch (*) { 2H + 1O -> 1H2O 1C + 3O -> 1CO2 + 1O } Reaction Reactants Products Stoichiometry

Combined Models 1 2

DNA Strand Displacement DNA strand = large molecule Different types of strands combine and displace

DNA Strand Displacement Chemical reactions between DNA species Complementarity of DNA domains Example: DSD Logic Gate [Output = Input1 AND Input2] Input 1 Input 2 Output Substrate

DNA Strand Displacement Chemical reactions between DNA species Complementarity of short/long DNA domains Example: DSD Logic Gate [Output = Input1 AND Input2] Input 2 Input 1 Output Substrate

DNA Strand Displacement Chemical reactions between DNA species Complementarity of short/long DNA domains Example: DSD Logic Gate [Output = Input1 AND Input2] Input 2 Input 1 Output Substrate

DNA Strand Displacement Chemical reactions between DNA species Complementarity of short/long DNA domains Example: DSD Logic Gate [Output = Input1 AND Input2] Input 1 Output Input 2 Substrate

DNA Strand Displacement Chemical reactions between DNA species Complementarity of short/long DNA domains Example: DSD Logic Gate [Output = Input1 AND Input2] Output Input 1 Input 2 Substrate

AND Gate in DNA

SMT Encoding Set of species Set of reactions or r0 r2 r1 r3 q' q q‘’ + Set of reactions r0 r1 r2 r3 r4 r5 s6 or q'(s0)=q(s0)-1 q'(s1)=q(s1) q'(s3)=q(s3)-1 q'(s6)=q(s6) q’(s4)=q’(s4)+1 q(s0) q(s1) q(s3) q(s6) q(s4) q‘’(s0)=q(s0) q‘’(s1)=q(s1)-1 q‘’(s3)=q(s3)-1 q‘’(s6)=q(s6)+1 q’’(s4)=q’(s4) r0 r2 r1 r3 q' q q‘’

Abstractions and Approximations Finite state space Time (continuous vs. discrete) Probabilities Environment assumptions Bounded analysis

Invariants Laws of Physics, Chemistry, etc. State invariants Transition invariants Especially: Mass Conservation E.g., DNA is not created out of thin air and does not vanish

Transducer A T B

DNA Transducer CRN

Transducer Evaluation Good Bad (K=100)

Correct Transducer Design (K=100)

Challenges Highly concurrent systems Usually no long sequences like in software Vast numbers of molecules (or atoms, strands, etc.) (Often probabilistic)

An example L. Qian, E. Winfree: Scaling Up Digital Circuit Computation with DNA Strand Displacement Cascades, Science 332/6034, 2011.

Analyzing the DNA Square Root Circuit Added multi-step reactions Added mass (strand) conservation constraints Functional property, i.e., 𝑜𝑢𝑡𝑝𝑢𝑡= 𝑖𝑛𝑝𝑢𝑡 (Up to) 10 6 copies in parallel Results within minutes # species: 191; #reactions: 146

A Larger Example # Reactions 7,440 # Metabolites 5,063 I. Thiele et al: A community-driven global reconstruction of human metabolism, Nature Biotech. 31/5, 2013.

A Larger Example “We tested Recon 2 for self-consistency, a process that included gap analysis and leak tests” I. Thiele et al: A community-driven global reconstruction of human metabolism, Nature Biotech. 31/5, 2013. “We describe here the manual reconstruction process in detail” [The COBRA] toolbox was extended to facilitate the reconstruction, debugging, and manual curation process described herein. I. Thiele, B. Palsson: A protocol for generating a high-quality genome-scale metabolic reconstruction, Nature Protocols 5, 2010.

Conclusion Computational Biology Z34Bio Future extensions Benchmarks An auspicious new application domain SMT plays an important role Z34Bio A framework and tool for analysis of various biological systems Current basis: CRNs and BNs Future extensions Leverage more theories, e.g., Reals, Floats, Probabilities LTL/CTL-like properties Benchmarks http://research.microsoft.com/z3-4biology