Dynamic Modeling Of Biological Systems. Why Model? When it’s a simple, constrained path we can easily go from experimental measurements to intuitive understanding.

Slides:



Advertisements
Similar presentations
A core course on Modeling kees van Overveld Week-by-week summary.
Advertisements

Evidence for Complex Causes
Modeling of Complex Social Systems MATH 800 Fall 2011.
Zooming in on Probability and Causality (aim & preliminary results)
An Intro To Systems Biology: Design Principles of Biological Circuits Uri Alon Presented by: Sharon Harel.
Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.
Graphs Graphs are the most general data structures we will study in this course. A graph is a more general version of connected nodes than the tree. Both.
CSE Fall. Summary Goal: infer models of transcriptional regulation with annotated molecular interaction graphs The attributes in the model.
Lecture #1 Introduction.
Complexity 12-1 Complexity Andrei Bulatov Non-Deterministic Space.
Models and methods in systems biology Daniel Kluesing Algorithms in Biology Spring 2009.
Petri net modeling of biological networks Claudine Chaouiya.
XML Documentation of Biopathways and Their Simulations in Genomic Object Net Speaker : Hungwei chen.
Biology Developmental Genetics Lecture #6 – Modeling in Development.
Gene Regulatory Networks - the Boolean Approach Andrey Zhdanov Based on the papers by Tatsuya Akutsu et al and others.
October 7, 2010Neural Networks Lecture 10: Setting Backpropagation Parameters 1 Creating Data Representations On the other hand, sets of orthogonal vectors.
Feedback Control Systems (FCS)
Radial Basis Function Networks
Chapter 12: Simulation and Modeling
Introduction to Physical Science
Analyzing the systemic function of genes and proteins Rui Alves.
Copyright © by Holt, Rinehart and Winston. All rights reserved. ResourcesChapter menu The Science of Physics Chapter 1 Table of Contents Section 1 What.
Introduction to Science: The Scientific Method
Nattee Niparnan. Easy & Hard Problem What is “difficulty” of problem? Difficult for computer scientist to derive algorithm for the problem? Difficult.
Fundamentals of Data Analysis Lecture 9 Management of data sets and improving the precision of measurement.
What is a model Some notations –Independent variables: Time variable: t, n Space variable: x in one dimension (1D), (x,y) in 2D or (x,y,z) in 3D –State.
Science This introductory science course is a prerequisite to other science courses offered at Harrison Trimble. Text: Nelson, Science 10 Prerequisite:
The Nature of Modeling and Modeling Nature. “The sciences do not try to explain, they hardly even try to interpret, they mainly make models… The justification.
Copyright © by Holt, Rinehart and Winston. All rights reserved. ResourcesChapter menu Copyright © by Holt, Rinehart and Winston. All rights reserved. ResourcesChapter.
Chapter 1 Introduction to Statistics. Statistical Methods Were developed to serve a purpose Were developed to serve a purpose The purpose for each statistical.
DIFFERENTIAL EQUATIONS 9. Perhaps the most important of all the applications of calculus is to differential equations. DIFFERENTIAL EQUATIONS.
Questions From Reading Activity? Big Idea(s):  The interactions of an object with other objects can be described by forces.  Interactions between.
WHAT IS SCIENCE? WHAT IS SCIENCE? An organized way of gathering and analyzing evidence about the natural world.
Complexity of Algorithms
VIRTUAL WORLDS IN EDUCATIONAL RESEARCH © LOUIS COHEN, LAWRENCE MANION & KEITH MORRISON.
Conceptual Modelling and Hypothesis Formation Research Methods CPE 401 / 6002 / 6003 Professor Will Zimmerman.
1 Departament of Bioengineering, University of California 2 Harvard Medical School Department of Genetics Metabolic Flux Balance Analysis and the in Silico.
The Scientific Method.
Systems Biology ___ Toward System-level Understanding of Biological Systems Hou-Haifeng.
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Path Analysis and Structured Linear Equations Biologists in interested in complex phenomena Entails hypothesis testing –Deriving causal linkages between.
The elements of higher mathematics Differential Equations
Graphing  A mathematical picture  Graphs are used to show information quickly and simply  Change one variable at a time to determine relationships 
Scientific Debugging. Errors in Software Errors are unexpected behaviors or outputs in programs As long as software is developed by humans, it will contain.
Boolean Networks and Biology Peter Lee Shaun Lippow BE.400 Final Project December 10, 2002.
Presenting A Dynamic Field Model of The A-not-B Error.
Chapter 1 Preview Objectives Physics The Scientific Method Models
CS6045: Advanced Algorithms NP Completeness. NP-Completeness Some problems are intractable: as they grow large, we are unable to solve them in reasonable.
Advanced Software Development applied to (Symbolic) Systems Biology Karl Lieberherr.
The Nature of Science. Objective  COS 12.0 Identify the metric units used for mass, temperature, time and length (distance)
A Brief Maximum Entropy Tutorial Presenter: Davidson Date: 2009/02/04 Original Author: Adam Berger, 1996/07/05
Complexity and Hierarchy
Modeling & Simulation of Dynamic Systems (MSDS)
Computational methods for inferring cellular networks II Stat 877 Apr 17 th, 2014 Sushmita Roy.
Science and Engineering Practices K–2 Condensed Practices3–5 Condensed Practices6–8 Condensed Practices9–12 Condensed Practices Developing and Using Models.
The Goal of Science To create a set of models that describe the measurable universe. These models must – Fit previous verified measurements applicable.
Abstraction and Abstract Interpretation. Abstraction (a simplified view) Abstraction is an effective tool in verification Given a transition system, we.
Introduction to Modeling Technology Enhanced Inquiry Based Science Education.
Modelling & Simulation of Semiconductor Devices Lecture 1 & 2 Introduction to Modelling & Simulation.
Dynamical Systems Modeling
State Space Representation
Models.
Linear Control Systems
7th and 8th Grade Science Weiner High School
Introduction Artificial Intelligent.
State Space Analysis UNIT-V.
Chapter 1 Preview Objectives Physics The Scientific Method Models
Computational Biology
Kalman Filter: Bayes Interpretation
Presentation transcript:

Dynamic Modeling Of Biological Systems

Why Model? When it’s a simple, constrained path we can easily go from experimental measurements to intuitive understanding. But with more elements often generates counter-intuitive behavior. Counter-intuitive, but not unpredictable.

Why Model? Knowledge integration Hypothesis testing Prediction of response Discovery of fundamental processes

We discussed over the course an attempt to (mostly) statically analyze biological pathways. Our “cartoon” drawings were a sort of model; emphasizing who interacts and operates on whom, who is important and who isn’t. Also, these were of course abstractions and generalizations, which entail a qualitive understanding. These are models. We would like to create mathematical models, and test

Predictions Indicating we have identified a necessary amount of players, to a necessary precision → what is important to this process and what is not. If our predictions fail, might indicate not qualitively understanding the underlying mechanism. Feeds back to the experimental realm: pointing to where more data is needed

Creating the model The model itself may be the explanation, i.e if you can intuitively understand the results of changing a parameter without solving the underlying equations. Building the model requires thinking out the important questions that lead to qualitive understanding of the system: what we’re looking for. The model can be a plausibility test

Scale Biological pathways occur on radically different scales of time, complexity and space. Choosing the right model scale is critical: –Coarse grained models rely on prior intuition and generalization, but less accurate causality. –Fine grained requires more detailed data, while the amount of precision provided may not be necessary.

Low Scale Model of Large Scale Phenomena It can be easier create a computation- heavy modeling of molecular interactions, and see the emerging, expected high-level phenomena. –The model itself might not yield any insight on the principles of the mechanism. –But it does give us complete control of every parameter in the system

Interpretability While translating biological data into a model may be relatively easy (and has a long history), how things translate back into the realm of biology is not always that clear. With dynamic models which you allow to “run”, the model will lead to new states, what do these states represent?

Qualitative Networks

Boolean Networks: B(V,F) A Boolean network is a directed, weighed graph, for which each component (=vertex), has a state: 0 or 1. The effect of each component on the next is a function of its value and the edge weight.

Boolean Networks For each state i at time t we have a function for the value of t in the next round.

Boolean Networks: Example So:A=0 → B=0 A=1 → B=1 B=0 → C=0 B=1 → C=1 B,C =0,0 → A= A -1 B,C =0,1 → A= 0 B,C =1,0 → A= 1 B,C =1,1 → A= 0 A B C w = 1 w = -2 w = Attractors: states visited infinitely many times We can represent a state at a given time as a triplet: (101): A=1, B=0, C=1

Qualitive Networks: Q(V,F,N) We would like to allow the expression of a component to a finer detail than just ‘ON’ and ‘OFF’. In a Qualitive Network, each component can have a value between 0 and N. The Qualitive Network Q(V,F,1) is in fact a Boolean Network.

Qualitive Networks The transition function in a Qualitive Network defines for every component c i a target i function, of {0…N} |C| →{0…N}. We allow changing the expression of a component by maximum of 1 each turn:

Like in Boolean Networks, Inhibition and Activation are marked by negative and positive weights on the edges. We will calculate the amount of activation on component i relatively to the maximum amount of activation it could receive: Qualitive Networks: Calculating target i and symmetrically:

So we get: The second line entails a hidden assumption, that if c i gets no activation, it’s activation is not modeled. Qualitive Networks: Calculating target i

Representing Unknown Interactions We do not always know how each element behaves in a system. Also, many elements may be influenced by components external to our model. Such components, with unknown behavior can be modeled by non-deterministic variables. These variables may start at any value, but are still confined to changing by at most 1 at each turn. This is sufficient to capture any possible behavior of this component.

Non-Determinism Instead of simulation (which can be exponentially hard), we’ll use model-checking tools to verify the specifications of the entire system when we have non-deterministic elements. Because we have in fact checked for any possible behavior from the unknown components, we have shown that the specifications hold, independent of unknown component behavior.

Attractors: Infinitely Visited States The attractors of a Qualitive Network correspond to the steady states of the biological system. Other states can be seen as unstable steps that will quickly evolve into an attractor. When checking if a specification holds for the system, we do not insist that they hold for every state, only for the attractors.

Attractors: Infinitely Visited States In the Qualitive model, we will often concern ourselves with the attractors in the model, specifically: –How many are there? –Which start positions lead to which attractors? Instead of testing the exponentially many possible start positions, we will prune the number based on biological data and only test those that interest us.

Example: Crosstalk between Notch and Wnt Pathways Pathways that play roles in proliferation and differentiation in mammalian epidermis. Maintain cell in proliferating state Initiate differentiation ?

Crosstalk between Notch and Wnt Pathways Assumption 1) When GT1 > GT2 the cell is proliferating, when GT1 < GT2 the cell is differentiated. Assumption 2) When the cell is more inclined to proliferation (GT1 is high or when GT2 is low) the cell is more sensitive to chemically induced carcinogenesis.

We’ll take 5 cells to represent the layers of the skin High Wnt from the Dermis Low Wnt from the upper layers of skin

Modeling 5 identical cells. 4 levels of activation: off, low, medium, high All activation and inhibition have equal weight. Each cell senses the Wnt and Notch ligand expressions of it’s two immediate neighbors.

Specifications H1) GT1 1 > GT2 1 GT1 4-5 < GT2 4-5 H2) GT1 i = GT2 i → for j>i: GT1 j ≤ GT2 j GT1 i i: GT1 j < GT2 j Notch KO experiments show an increased proliferation as well as increased sensitivity to carcinogenesis, we’ll formulate these as: H3) Notch KO → GT1 4 > GT2 4 H4) Notch KO → GT1 1-5 increase or GT2 1-5 decrease.

Analysis 6561 infinitely visited states were found All adhere to H1 and H2 (C 1 proliferating, C 4-5 differentiated) Not all agree on levels of C 2, perhaps indicating it is in transition. KO of Notch starting from a steady state leads to satisfaction of H3 and H4 as well.

Analysis Single cell analysis in which all external signals are non-deterministic refute the hypothesis that Notch-IC activates transcription of β-Cat: For no starting state do we arrive at an attractor for which GT1 > GT2; no cell could be proliferating. This means there is another mechanism activating β-Cat.