Gene Regulatory Networks - the Boolean Approach Andrey Zhdanov Based on the papers by Tatsuya Akutsu et al and others.

Slides:



Advertisements
Similar presentations
Systems biology SAMSI Opening Workshop Algebraic Methods in Systems Biology and Statistics September 14, 2008 Reinhard Laubenbacher Virginia Bioinformatics.
Advertisements

Problems and Their Classes
Naïve Bayes. Bayesian Reasoning Bayesian reasoning provides a probabilistic approach to inference. It is based on the assumption that the quantities of.
16.4 Estimating the Cost of Operations Project GuidePrepared By Dr. T. Y. LinVinayan Verenkar Computer Science Dept San Jose State University.
Predicting essential genes via impact degree on metabolic networks ISSSB’11 Takeyuki Tamura Bioinformatics Center, Institute for Chemical Research Kyoto.
CSCE555 Bioinformatics Lecture 3 Gene Finding Meeting: MW 4:00PM-5:15PM SWGN2A21 Instructor: Dr. Jianjun Hu Course page:
SBML2Murphi: a Translator from a Biology Markup Language to Murphy Andrea Romei Ciclo di Seminari su Model Checking Dipartimento di Informatica Università.
CGeMM – University of Louisville Mining gene-gene interactions from microarray data - Coefficient of Determination Marcel Brun – CGeMM - UofL.
Image Analysis Phases Image pre-processing –Noise suppression, linear and non-linear filters, deconvolution, etc. Image segmentation –Detection of objects.
CSE Fall. Summary Goal: infer models of transcriptional regulation with annotated molecular interaction graphs The attributes in the model.
D ISCOVERING REGULATORY AND SIGNALLING CIRCUITS IN MOLECULAR INTERACTION NETWORK Ideker Bioinformatics 2002 Presented by: Omrit Zemach April Seminar.
A Probabilistic Dynamical Model for Quantitative Inference of the Regulatory Mechanism of Transcription Guido Sanguinetti, Magnus Rattray and Neil D. Lawrence.
1 DNA Computing: Concept and Design Ruoya Wang April 21, 2008 MATH 8803 Final presentation.
Models and methods in systems biology Daniel Kluesing Algorithms in Biology Spring 2009.
Petri net modeling of biological networks Claudine Chaouiya.
Lecture 2 Dr Richard Reilly Dept. of Electronic & Electrical Engineering Room 153, Engineering Building To insert your company logo on this slide From.
Sequential Circuits and Finite State Machines Prof. Sin-Min Lee
Tirgul 8 Universal Hashing Remarks on Programming Exercise 1 Solution to question 2 in theoretical homework 2.
CHAPTER 3 The Church-Turing Thesis
Shuchi Chawla, Carnegie Mellon University Static Optimality and Dynamic Search Optimality in Lists and Trees Avrim Blum Shuchi Chawla Adam Kalai 1/6/2002.
Exploring Network Inference Models Math-in-Industry Camp & Workshop: Michael Grigsby: Cal Poly, Pomona Mustafa Kesir: Northeastern University Nancy Rodriguez:
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Applications of Symbolic Logic to Gene Regulation Systems Department of Computer Science and Information Engineering of National Chi-Nan University Advisor:
The Arkin model of the lysis- lysogeny decision of phage lambda Tom Evans.
Inferring the nature of the gene network connectivity Dynamic modeling of gene expression data Neal S. Holter, Amos Maritan, Marek Cieplak, Nina V. Fedoroff,
6. Gene Regulatory Networks
Geometric Approaches to Reconstructing Time Series Data Project Update 29 March 2007 CSC/Math 870 Computational Discrete Geometry Connie Phong.
Gaussian Processes for Transcription Factor Protein Inference Neil D. Lawrence, Guido Sanguinetti and Magnus Rattray.
Digital Computer Design Fundamental
Chapter 2 Modeling and Finding Abnormal Nodes. How to define abnormal nodes ? One plausible answer is : –A node is abnormal if there are no or very few.
Using Bayesian Networks to Analyze Expression Data N. Friedman, M. Linial, I. Nachman, D. Hebrew University.
Learning Structure in Bayes Nets (Typically also learn CPTs here) Given the set of random variables (features), the space of all possible networks.
A Unified Modeling Framework for Distributed Resource Allocation of General Fork and Join Processing Networks in ACM SIGMETRICS
DECIDABILITY OF PRESBURGER ARITHMETIC USING FINITE AUTOMATA Presented by : Shubha Jain Reference : Paper by Alexandre Boudet and Hubert Comon.
Modeling and identification of biological networks Esa Pitkänen Seminar on Computational Systems Biology Department of Computer Science University.
Trust-Aware Optimal Crowdsourcing With Budget Constraint Xiangyang Liu 1, He He 2, and John S. Baras 1 1 Institute for Systems Research and Department.
Lecture 4: Metabolism Reaction system as ordinary differential equations Reaction system as stochastic process.
ECE 8443 – Pattern Recognition Objectives: Error Bounds Complexity Theory PAC Learning PAC Bound Margin Classifiers Resources: D.M.: Simplified PAC-Bayes.
CS1Q Computer Systems Lecture 6 Simon Gay. Lecture 6CS1Q Computer Systems - Simon Gay2 Algebraic Notation Writing AND, OR, NOT etc. is long-winded and.
Solution Space? In most cases lack of constraints provide a space of solutions What can we do with this space? 1.Optimization methods (previous lesson)
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. Circuit Optimization Logic and Computer Design Fundamentals.
Summary Various mathematical models describing gene regulatory networks as well as algorithms for network reconstruction from experimental data have been.
Combinatorial State Equations and Gene Regulation Jay Raol and Steven J. Cox Computational and Applied Mathematics Rice University.
Selection Control Structures. Simple Program Design, Fourth Edition Chapter 4 2 Objectives In this chapter you will be able to: Elaborate on the uses.
ECE 8443 – Pattern Recognition LECTURE 07: MAXIMUM LIKELIHOOD AND BAYESIAN ESTIMATION Objectives: Class-Conditional Density The Multivariate Case General.
九大数理集中講義 Comparison, Analysis, and Control of Biological Networks (4) Analysis and Control of Boolean Networks Tatsuya Akutsu Bioinformatics Center Institute.
1 Lecture #12 EGR 277 – Digital Logic Synchronous Logic Circuits versus Combinational Logic Circuits A) Combinational Logic Circuits Recall that there.
Jeffrey Zheng School of Software, Yunnan University August 4, nd International Summit on Integrative Biology August 4-5, 2014 Chicago, USA.
A Biology Primer Part IV: Gene networks and systems biology Vasileios Hatzivassiloglou University of Texas at Dallas.
By Rosalind Allen Regulatory networks Biochemical noise.
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley.
Sampling distributions rule of thumb…. Some important points about sample distributions… If we obtain a sample that meets the rules of thumb, then…
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition LECTURE 07: BAYESIAN ESTIMATION (Cont.) Objectives:
SemiBoost : Boosting for Semi-supervised Learning Pavan Kumar Mallapragada, Student Member, IEEE, Rong Jin, Member, IEEE, Anil K. Jain, Fellow, IEEE, and.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
Signals and Systems Analysis NET 351 Instructor: Dr. Amer El-Khairy د. عامر الخيري.
1 Applications of Symbolic Logic to Gene Regulation Systems Department of Computer Science and Information Engineering of National Chung-Cheng University.
Computational methods for inferring cellular networks II Stat 877 Apr 17 th, 2014 Sushmita Roy.
MODELING AND SIMULATION CS 313 Simulation Examples 1.
Discriminative n-gram language modeling Brian Roark, Murat Saraclar, Michael Collins Presented by Patty Liu.
Theory of Computational Complexity M1 Takao Inoshita Iwama & Ito Lab Graduate School of Informatics, Kyoto University.
Independent Samples: Comparing Means Lecture 39 Section 11.4 Fri, Apr 1, 2005.
Inferring Regulatory Networks from Gene Expression Data BMI/CS 776 Mark Craven April 2002.
Modeling and Simulation CS 313
Bud Mishra Professor of Computer Science and Mathematics 12 ¦ 3 ¦ 2001
Professor Arne Thesen, University of Wisconsin-Madison
Hidden Markov Models Part 2: Algorithms
FUNCTIONAL ANNOTATION OF REGULATORY PATHWAYS
Example: Verification
Information Theoretical Analysis of Digital Watermarking
Presentation transcript:

Gene Regulatory Networks - the Boolean Approach Andrey Zhdanov Based on the papers by Tatsuya Akutsu et al and others

Gene Expressions Revisited Gene Regulatory Networks - the Boolean Approach

Gene Expressions Revisited One of the major subjects of study in cell biology is the behaviour of proteins – the “workhorses” of a cell. Myoglobin molecule

Gene Expressions Revisited We are interested in analysing protein expression levels – amounts of different proteins synthesized by the cell.

Gene Expressions Revisited The “blueprints” for all possible proteins that can be synthesized by a cell – genes – are stored in the cell's nucleus. Only small fraction of all possible proteins is synthesized in each cell.

Gene Expressions Revisited Proteins are synthesized from genes by the process of transcription and translation.

Gene Expressions Revisited We estimate protein expression levels indirectly – by measuring gene expression levels (amounts of mRNA produced for a certain gene) with DNA chips.

Gene Expressions Revisited This approach makes a number of assumptions: Genes exist and are easily identifiable Each protein is encoded by a single gene Protein expression (amount of protein produced) is determined by the corresponding gene expression (amount of mRNA produced) These assumptions do not always hold (but we use them anyway :-)

Gene Regulatory Networks Gene Regulatory Networks - the Boolean Approach

Gene Regulatory Networks We want to use protein (or gene) expression measurements to understand the mechanisms regulating proteins' production. Note that there is certain circularity to our logic since we made certain assumptions about these very same mechanisms in order to measure protein expressions.

Gene Regulatory Networks In the talks by Shahar and Leon we have seen the “regulatory network” approach to modelling the protein expression mechanisms. In his talk Oded has introduced tools for time series analysis that can be applied to our problem.

Gene Regulatory Networks We are looking for a formal model of the protein expression control mechanism that can serve as a framework for a rigorous treatment of the problem. To that end we assume that production rate of a certain protein at any given time is regulated only by the amount of other proteins within the cell at that time.

Gene Regulatory Networks Example: Protein A excites Protein B excites Protein C Protein D inhibits Protein A Protein D Protein C Protein B Expression level time

Treating the gene expressions as real-valued functions of continuous time variable leads to the system of differential equations as the model for the gene regulatory network. Gene Regulatory Networks

Boolean Regulatory Networks Gene Regulatory Networks - the Boolean Approach

Boolean Regulatory Networks To facilitate the treatment of the problem we further simplify our model to the Boolean Regulatory Network. We assume: 1. Discrete time and synchronous update model 2. Genes’ expression level is binary

Boolean Regulatory Networks More formally, a boolean network consists of a set of nodes representing genes and a list of boolean functions where is computes boolean function of nodes and assigns the output to

Boolean Regulatory Networks The state of the network at time t is defined by assignment of 0s and 1s to the node variables. The state of each node at time t+1 is calculated from the states of the nodes at time t according to

Boolean Regulatory Networks Boolean regulatory network can be visualized by the means of wiring diagram:

Boolean Regulatory Networks Since the network’s state at t+1 is completely determined by its state at t, we can treat the gene expressions time series as an unordered set of input / output pairs. We say that the network is consistent with a set of input/output pairs if for each pair setting the network to the input state at time t causes it to reach the output state at t+1.

Boolean Regulatory Networks We can now start formulating some of the fundamental problems for our model. CONSISTENCY: Given the number of nodes and set of input/output pairs, decide whether there is a boolean network consistent with the pairs.

Boolean Regulatory Networks COUNTING: Given the number of nodes and set of input/output pairs, count the number of boolean networks consistent with the pairs.

Boolean Regulatory Networks ENUMERATION: Given the number of nodes and set of input/output pairs, output all the boolean networks consistent with the pairs.

Boolean Regulatory Networks IDENTIFICATION: Given the number of nodes and set of input/output pairs, decide whether there is a unique boolean network consistent with the pairs and output one if exists.

Boolean Regulatory Networks The four problems presented above are closely related. We address them in the straightforward manner by constructing all possible boolean networks and checking them on all the input/output pairs. To make this task computationally feasible we need yet another assumption – we assume that the network’s indegree is bounded by some constant K.

Boolean Regulatory Networks Some of the results: The complexity of the brute-force algorithm for the CONSISTENCY problem is Where is the number of nodes (genes) and is the number of input/output pairs. The results for the other problems are similar.

Boolean Regulatory Networks Another theoretical result concerns the number of input/output pairs required to uniquely identify a boolean network. Again, to facilitate calculations, we make an unrealistic assumption: we assume that the input/output pairs are randomly drawn from a uniform distribution.

Boolean Regulatory Networks Theorem: If input/output expressions are drawn from a uniform distribution, the probability that there are more than one boolean network consistent with them is at most

Boolean Regulatory Networks Conclusions: Boolean gene expression networks represent a relatively simple model of the gene expression control mechanisms of the cell. However, despite many (often unrealistic) simplifying assumptions, this model has not yielded any interesting theoretical results yet, which indicates the intristic difficulty of modeling gene expression mechanisms.