Modeling Genetic Network: Boolean Network Yongyeol Ahn 2004.08.18. KAIST.

Slides:



Advertisements
Similar presentations
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Advertisements

DREAM4 Puzzle – inferring network structure from microarray data Qiong Cheng.
Feature Selection as Relevant Information Encoding Naftali Tishby School of Computer Science and Engineering The Hebrew University, Jerusalem, Israel NIPS.
Polynomial dynamical systems over finite fields, with applications to modeling and simulation of biological networks. IMA Workshop on Applications of.
Neural Network Models in Vision Peter Andras
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.
1 Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces Dmitri Krioukov CAIDA/UCSD Joint work with F. Papadopoulos, M.
School of Information University of Michigan Network resilience Lecture 20.
The multi-layered organization of information in living systems
Computing a tree Genome 559: Introduction to Statistical and Computational Genomics Prof. James H. Thomas.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Predicting Gene Expression using Logic Modeling and Optimization Abhimanyu Krishna New Challenges in the European Area: Young Scientist’s 1st International.
4. PREFERENTIAL ATTACHMENT The rich gets richer. Empirical evidences Many large networks are scale free The degree distribution has a power-law behavior.
1 Evolution of Networks Notes from Lectures of J.Mendes CNR, Pisa, Italy, December 2007 Eva Jaho Advanced Networking Research Group National and Kapodistrian.
Functionality & Speciation in Boolean Networks
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Evolvable by Design Panos Oikonomou James Franck Institute Institute of Biophysical Dynamics The University of Chicago Philippe Cluzel How topology affects.
Data Mining Techniques Outline
Regulatory Network (Part II) 11/05/07. Methods Linear –PCA (Raychaudhuri et al. 2000) –NIR (Gardner et al. 2003) Nonlinear –Bayesian network (Friedman.
CISC667, F05, Lec26, Liao1 CISC 667 Intro to Bioinformatics (Fall 2005) Genetic networks and gene expression data.
Regulatory networks 10/29/07. Definition of a module Module here has broader meanings than before. A functional module is a discrete entity whose function.
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.
Lecture 5: Learning models using EM
Fitting models to data. Step 5) Express the relationships mathematically in equations Step 6)Get values of parameters Determine what type of model you.
Gene Regulatory Networks - the Boolean Approach Andrey Zhdanov Based on the papers by Tatsuya Akutsu et al and others.
Advanced Topics in Data Mining Special focus: Social Networks.
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
6. Gene Regulatory Networks
Introduction to molecular networks Sushmita Roy BMI/CS 576 Nov 6 th, 2014.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
The Role of Specialization in LDPC Codes Jeremy Thorpe Pizza Meeting Talk 2/12/03.
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
The Erdös-Rényi models
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Demetris Kennes. Contents Aims Method(The Model) Genetic Component Cellular Component Evolution Test and results Conclusion Questions?
Genetic network inference: from co-expression clustering to reverse engineering Patrik D’haeseleer,Shoudan Liang and Roland Somogyi.
What Is a Gene Network?. Gene Regulatory Systems “Programs built into the DNA of every animal.” Eric H. Davidson.
Microarrays to Functional Genomics: Generation of Transcriptional Networks from Microarray experiments Joshua Stender December 3, 2002 Department of Biochemistry.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Conceptual Modelling and Hypothesis Formation Research Methods CPE 401 / 6002 / 6003 Professor Will Zimmerman.
Multiple attractors and transient synchrony in a model for an insect's antennal lobe Joint work with B. Smith, W. Just and S. Ahn.
September Bound Computation for Adaptive Systems V&V Giampiero Campa September 2008 West Virginia University.
Systems Biology ___ Toward System-level Understanding of Biological Systems Hou-Haifeng.
Module networks Sushmita Roy BMI/CS 576 Nov 18 th & 20th, 2014.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: ML and Simple Regression Bias of the ML Estimate Variance of the ML Estimate.
Synchronization in complex network topologies
LEAST MEAN-SQUARE (LMS) ADAPTIVE FILTERING. Steepest Descent The update rule for SD is where or SD is a deterministic algorithm, in the sense that p and.
Steady-state Analysis of Gene Regulatory Networks via G-networks Intelligent Systems & Networks Group Dept. Electrical and Electronic Engineering Haseong.
Network Evolution Statistics of Networks Comparing Networks Networks in Cellular Biology A. Metabolic Pathways B. Regulatory Networks C. Signaling Pathways.
Chapter1: Introduction Chapter2: Overview of Supervised Learning
Bioinformatics Center Institute for Chemical Research Kyoto University
1 Satellite Meeting of STATPHYS 22(KIAS) Bak-Sneppen Evolution models on Random and Scale-free Networks I. Introduction II. Random Neighbor Model III.
Discriminative Training and Machine Learning Approaches Machine Learning Lab, Dept. of CSIE, NCKU Chih-Pin Liao.
Bayesian Modeling of Quantum-Dot-Cellular-Automata Circuits Sanjukta Bhanja and Saket Srivastava Electrical Engineering, University of South Florida, Tampa,
Giansalvo EXIN Cirrincione unit #4 Single-layer networks They directly compute linear discriminant functions using the TS without need of determining.
Computational methods for inferring cellular networks II Stat 877 Apr 17 th, 2014 Sushmita Roy.
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
Dynamic Network Analysis Case study of PageRank-based Rewiring Narjès Bellamine-BenSaoud Galen Wilkerson 2 nd Second Annual French Complex Systems Summer.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Inferring Regulatory Networks from Gene Expression Data BMI/CS 776 Mark Craven April 2002.
Dimension Review Many of the geometric structures generated by chaotic map or differential dynamic systems are extremely complex. Fractal : hard to define.
Building and Analyzing Genome-Wide Gene Disruption Networks
CHAPTER 29: Multiple Regression*
CISC 841 Bioinformatics (Spring 2006) Inference of Biological Networks
Boltzmann Machine (BM) (§6.4)
CISC 667 Intro to Bioinformatics (Spring 2007) Genetic networks and gene expression data CISC667, S07, Lec24, Liao.
Presentation transcript:

Modeling Genetic Network: Boolean Network Yongyeol Ahn KAIST

Genetic Network Genes interact with each other via proteins, RNAs and themselves.

Main Objectives To infer genetic network from biological data To explain and predict the behaviors of genetic regulatory network

Modeling Genetic Networks Statistics rules!  Bayesian network Hmm.. We need some dynamics. Let’s be realistic!  Differential equation approach Simple is the best!  Boolean network

Bayesian Network : Information Theory Shannon entropy: Joint probability: Pr(x,y) Conditional probability: Pr(y|x) = Pr(x,y)/Pr(x) Mutual information:

Bayesian Network Find a directed acyclic graph which shows the relationships of nodes well. X i : Expression level

Differential Equation Approach Gene A Gene R A A 1 A A A 50 R 5 C ‘ The Clock ’

Differential Equation Approach Expressed genes mRNAs R A A C R R C

Why Boolean network? It tells about the dynamics (vs. bayesian network) ‘Gene switch’ : There are attempts to make a ‘genetic computer’ using genetic ‘logic gates’.  Binary state approximation is fine. In many cases, the exact timing may not be important. Simple, general, easy to implement, …

The Boolean Network Nodes, Directed links Synchronous dynamics Binary states: ‘on’ or ‘off’ A node’s state is determined by states of other nodes which have a link to the node(by assigned boolean functions).

Example Node 0 Node t

Boolean Network Variations Multi-Valued model Different updating scheme (asynchronous, …) Probabilistic model

Classification of boolean networks (Gershenson2004)

Tools DDLab – RBNLab – BN/PBN toolbox: –

(Classical) Random Boolean Network Parameter: N, K, p –N: number of nodes –K: average in-degree –p: probability of ‘1’ in each boolean function Large ensemble,state space(2^N)  So big!  Very high standard deviations

Phase Transition Stable (K<=2) Critical Chaotic (K>=3) Visualization method –Active nodes: ‘green’ –Frozen nodes: ‘red’

Phase Transition Islands –Chaotic: green sea percolate & red islands –Stable: frozen red sea & green islands Robustness –Chaotic: damage spreads –Stable: robust Convergence and divergence of traj. (Lyapunov exponent) –Chaotic: similar states tend to diverge –Stable: tend to converge

Loops  Trees For active dynamics, network needs Loops. Loops activate other parts (trees). Active wave propagates from loops to trees.

G – Density G-density : Garden of Eden states density Ordered: very high G-density, high in- degree frequency Critical: power-law in-degree distribution Chaotic: lower G-density,

Analytical Result of Phase Transition Derrida’s annealed approx. : Assuming connections and boolean functions are randomly reshuffled at each time step. Define overlap = 1 – Normalized Hamming distance between two states What will happen at t  inf ?

Analytical Result of Phase Transition For a network with in-degree k, Transforming with Hamming distance and consider bias

Derrida Curves K=2 K=5 Critical connectivity

Phase diagram (In practice, the size of the network can play a role in the phase transitions)

Topology of boolean network In reality, genetic networks have very inhomogeneous degree distribution Using Derrida’s annealed approximation, the phase diagram for scale-free network can be obtained.

Derrida’s Annealed Approx. For Power-law Degree Distribution By the assumption, x(t) obeys the equation Where,

Contd.

Topology of boolean network: Scale-free boolean network

Attractors

The Number of Attractors The number of attractors grows faster than any power law with system size. (Samuelsson2003)

The Length of Attractor For K=1, root(N/2) At critical phase, it is long believed that the length proportional to root N (  Kauffman argued that this is related to the number of cell types ) But it is linear

Applications Reverse Engineering Morphogenesis model Segment polarity development Yeast transcriptional network

Reverse engineering: REVEAL REVerse Engineering Algorithm It finds a minimal solution for a boolean network given any set of time-series. Use entropy, mutual information

Neutral Mutation and Punctuated Equilibrium (Bornholdt1998) The model evolves under robustness principle (look for silent mutations) Threshold networks (restricted set of the boolean networks) Weight = ± 1, 0

Evolutionary Rule Create a daughter network by ‘adding’, ‘removing’, ‘adding and removing a weight in the coupling matrix’ at random. (each p = 1/3) With a random initial state, if mother & daughter reach the same attractor, replace the mother with the daughter. In other case, keep the mother network.

Punctuated Equilibrium The evolution shows punctuated network connectivity (lifetime ~ 1/t^2) Evolved networks have much shorter attractors, large frozen components

Model for Morphogenesis(Sole2003) Modeling an organism with one dimensional cell array. Each cells have the same set of genes and hormones. Genes interact within the cell. Hormones communicate with neighboring cells. Threshold model.

Morphogenesis Model

Development

Adaptive Walks ‘Toward more complex organism’ Complexity measure: the number of cell types Rule –Evolve many organism in parallel –Addition, Removal, randomization of link, link’s weight (each p=1/3) –Check the complexity

Logarithmic Increase of the Number of Patterns Consistent with Kauffman’s ‘rugged landscape’ explanation of Cambrian Explosion

Segment Polarity Network in Fly (Albert2003) The genetic network of Fly development This network is simulated with ODE(Dassow, 2002) and has shown a good result.

Boolean Network Construction Rules The effect of transcriptional activators and inhibitors is never additive, but rather, inhibitors are dominant. Transcription and translation are ON/OFF functions of the state If transcription/translation is ON, mRNAs/proteins are synthesized in one time step mRNAs decay in one time step if not transcribed Transcription factors and proteins undergoing post- translational modification decay in one time step if their mRNA is not present.

Constructed Boolean Network

Results Stable state is same as the real fly. Essential gene deletion results also agree with real data. There are six distinct steady states in the model. Three of these are well- known experimentally

Yeast transcriptional network(Kauffman2003) For a given network structure, they generate boolean network ensembles with nested canalyzing functions. The ensemble of networks are very stable.

Canalyzing Function Canalyzing boolean function has at least one input which the output value is fixed. In most cases, genetic networks consist of canalyzing functions.

Yeast Transcriptional Network Find topological transition point (to determine the confidence p value) Remove genes that have no output to other genes

Yeast Transcriptional Network For a given network structure.. –Functions with null hypothesis –Functions based on literature (canalyzing)

Nested Canalyzing Function Inputs i m, outputs O m, in degree k Assume i 1 is canalyzing input, then we can define a new rule without i 1 (with indegree k-1) In most cases, this new rule is also canalyzing.

Conclusion Boolean network model is simple, abstract, general. But, it’s powerful.