Discrete models of biochemical networks Algebraic Biology 2007 RISC Linz, Austria July 3, 2007 Reinhard Laubenbacher Virginia Bioinformatics Institute.

Slides:



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

Stochastic algebraic models SAMSI Transition Workshop June 18, 2009 Reinhard Laubenbacher Virginia Bioinformatics Institute and Mathematics Department.
Design of Experiments Questions Network Inference Working Group October 8, 2008.
Modeling and Simulation By Lecturer: Nada Ahmed. Introduction to simulation and Modeling.
Chapter 8 Topics in Graph Theory
Polynomial dynamical systems over finite fields, with applications to modeling and simulation of biological networks. IMA Workshop on Applications of.
A Mathematical Formalism for Agent- Based Modeling 22 nd Mini-Conference on Discrete Mathematics and Algorithms Clemson University October 11, 2007 Reinhard.
Modelling and Identification of dynamical gene interactions Ronald Westra, Ralf Peeters Systems Theory Group Department of Mathematics Maastricht University.
An Intro To Systems Biology: Design Principles of Biological Circuits Uri Alon Presented by: Sharon Harel.
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
Discrete models of biological networks Segunda Escuela Argentina de Matematica y Biologia Cordoba, Argentina June 29, 2007 Reinhard Laubenbacher Virginia.
Representing Relations Using Matrices
Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna New Challenges in the European Area: Young Scientist’s 1st International.
Dagstuhl 2010 University of Puerto Rico Computer Science Department The power of group algebras for constrained multilinear monomial detection Yiannis.
1. Elements of the Genetic Algorithm  Genome: A finite dynamical system model as a set of d polynomials over  2 (finite field of 2 elements)  Fitness.
Narapong Srivisal, Swarthmore College Class of 2007 Division Algorithm Fix a monomial order > in k[x 1, …, x n ]. Let F = (f 1, …, f s ) be an ordered.
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann.
CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)
Applications of Symbolic Logic to Gene Regulation Systems Department of Computer Science and Information Engineering of National Chi-Nan University Advisor:
Conjugacy and Dynamics in Thompson’s Groups Jim Belk (joint with Francesco Matucci)
Feb 23, 2007 EEE393 Basic Electrical Engineering K.A.Peker Signals and Systems Introduction EEE393 Basic Electrical Engineering.
Gröbner Bases Bernd Sturmfels Mathematics and Computer Science University of California at Berkeley.
CS6800 Advanced Theory of Computation Fall 2012 Vinay B Gavirangaswamy
01 March 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
Applied Discrete Mathematics Week 10: Equivalence Relations
1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.
A Study of The Applications of Matrices and R^(n) Projections By Corey Messonnier.
Outline Main result Quantum computation and quantum circuits Feynman’s sum over paths Polynomials QuPol program “Quantum Polynomials” Quantum polynomials.
Neurons, Neural Networks, and Learning 1. Human brain contains a massively interconnected net of (10 billion) neurons (cortical cells) Biological.
CSCI 4325 / 6339 Theory of Computation Zhixiang Chen.
Polynomial models of finite dynamical systems Reinhard Laubenbacher Virginia Bioinformatics Institute and Mathematics Department Virginia Tech.
Modeling and identification of biological networks Esa Pitkänen Seminar on Computational Systems Biology Department of Computer Science University.
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)
Using Gröbner Bases to Reconstruct Regulatory Modules in C. elegans Brandilyn Stigler Southern Methodist University.
Abstract Many research groups have described genetic and protein networks as networks of Boolean variables, and provided procedures for reverse engineering.
Introduction to Physical Science. A-Science- A-Science- Is a way of learning about the universe and it’s natural laws (Gravity) 1- Skills of scientist.
Feedback Control Systems (FCS) Dr. Imtiaz Hussain URL :
Mathematical Preliminaries
DISCRETE COMPUTATIONAL STRUCTURES CSE 2353 Fall 2010 Most slides modified from Discrete Mathematical Structures: Theory and Applications by D.S. Malik.
CSCI 115 Chapter 8 Topics in Graph Theory. CSCI 115 §8.1 Graphs.
1.1 Chapter 3: Proving NP-completeness Results Six Basic NP-Complete Problems Some Techniques for Proving NP-Completeness Some Suggested Exercises.
Section 3.4 Boolean Algebra. A link between:  Section 1.3: Logic Systems  Section 3.3: Set Systems Application:  Section 3.5: Logic Circuits in Computer.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
1 Beginning & Intermediate Algebra – Math 103 Math, Statistics & Physics.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Introduction The objective of simulation – Analysis the system (Model) Analytically the model – a description of some system intended to predict the behavior.
Hierarchical Modeling.  Explain the 3 different types of model for which computer graphics is used for.  Differentiate the 2 different types of entity.
Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop.
Analogue and digital techniques in closed loop regulation applications
Lecture 7: Constrained Conditional Models
Algebraic Proofs over Noncommutative Formulas
State Space Representation
ANALYSIS OF SEQUENTIAL CIRCUITS
Math Analysis.
Paper Code : BCA-27 Paper Title : Discrete Mathematics.
Introduction to Physical Science
Digital Control Systems (DCS)
Digital Control Systems (DCS)
Steven Lindell Scott Weinstein
Filtering and State Estimation: Basic Concepts
Comparing and Contrasting Functions
Discrete Mathematics CS 2610
Lecture 20: Combinatorial Circuits I
Boolean Algebra Introduction CSCI 240
§1-2 State-Space Description
State Space Analysis UNIT-V.
FUNCTIONS.
Computer Aided Geometric Design
COMS W1004 Introduction to Computer Science
Presentation transcript:

Discrete models of biochemical networks Algebraic Biology 2007 RISC Linz, Austria July 3, 2007 Reinhard Laubenbacher Virginia Bioinformatics Institute and Mathematics Department Virginia Tech

Polynomial dynamical systems Let k be a finite field and f 1, …, f n  k[x 1,…,x n ] f = (f 1, …, f n ) : k n → k n is an n-dimensional polynomial dynamical system over k. Natural generalization of Boolean networks. Fact: Every function k n → k can be represented by a polynomial, so all finite dynamical systems k n → k n are polynomial dynamical systems.

Example k = F 3 = {0, 1, 2}, n = 3 f 1 = x 1 x 2 2 +x 3, f 2 = x 2 +x 3, f 3 = x 1 2 +x 2 2. Dependency graph (wiring diagram)

Motivation: Gene regulatory networks “[The] transcriptional control of a gene can be described by a discrete-valued function of several discrete-valued variables.” “A regulatory network, consisting of many interacting genes and transcription factors, can be described as a collection of interrelated discrete functions and depicted by a wiring diagram similar to the diagram of a digital logic circuit.” Karp, 2002

Nature

Network inference using finite dynamical systems models Variables x 1, …, x n with values in k. (s 1, t 1 ), …, (s r, t r ) state transition observations with s j, t j  k n. Network inference: Identify a collection of “most likely” models/dynamical systems f=(f 1, …,f n ): k n → k n such that f(s j )=t j.

Important model information obtained from f=(f 1, …,f n ): The “wiring diagram” or “dependency graph” directed graph with the variables as vertices; there is an edge i → j if x i appears in f j. The dynamics directed graph with the elements of k n as vertices; there is an edge u → v if f(u) = v.

The Hallmarks of Cancer Hanahan & Weinberg (2000)

The model space Let I be the ideal of the points s 1, …, s r, that is, I =. Let f = (f 1, …, f n ) be one particular feasible model. Then the space M of all feasible models is M = f + I = (f 1 + I, …, f n + I).

Model selection Problem: The model space f + I is WAY TOO BIG Idea for Solution: Use “biological theory” to reduce it.

“Biological theory” Limit the structure of the coordinate functions f i to those which are “biologically meaningful.” (Characterize special classes computationally.) Limit the admissible dynamical properties of models. (Identify and computationally characterize classes for which dynamics can be predicted from structure.)

Nested canalyzing functions

A non-canalyzing Boolean network f1 = x4 f2 = x4+x3 f3 = x2+x4 f4 = x2+x1+x3

A nested canalyzing Boolean network g1 = x4 g2 = x4*x3 g3 = x2*x4 g4 = x2*x1*x3

Polynomial form of nested canalyzing Boolean functions

The vector space of Boolean polynomial functions

The variety of nested canalyzing functions

Input and output values as functions of the coefficients

The algebraic geometry Corollary. The ideal of relations determining the class of nested canalyzing Boolean functions on n variables defines an affine toric variety V ncf over the algebraic closure of F 2. The irreducible components correspond to the functions that are nested canalyzing with respect to a given variable ordering. That is, V ncf = U σ V σ ncf

Dynamics from structure Theorem. Let f = (f 1, …, f n ) : k n → k n be a monomial system. 1.If k = F 2, then f is a fixed point system if and only if every strongly connected component of the dependency graph of f has loop number 1. (Colón-Reyes, L., Pareigis) 2.The case for general k can be reduced to the Boolean + linear case. (Colón-Reyes, Jarrah, L., Sturmfels)

Questions What are good classes of functions from a biological and/or mathematical point of view? What extra mathematical structure is needed to make progress? How does the nature of the observed data points affect the structure of f + I and M X ?

Open Problems Study stochastic polynomial dynamical systems. Stochastic update order Stochastic update functions

Advertisement 1 Modeling and Simulation of Biological Networks Symposia in Pure and Applied Math, AMS articles by Allman-Rhodes, Pachter, Stigler, ….

Advertisement 2 Year-long program at the Statistical and Applied Mathematical Sciences Institute (SAMSI): Algebraic methods in systems biology and statistics