Ahnert, S. E., & Fink, T. M. A. (2016). Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties.

Slides:



Advertisements
Similar presentations
Motif Mining from Gene Regulatory Networks
Advertisements

Network analysis Sushmita Roy BMI/CS 576
Analysis of High-Throughput Screening Data C371 Fall 2004.
Britain Southwick Nicole Anguiano March 29, 2014
Network biology Wang Jie Shanghai Institutes of Biological Sciences.
An Intro To Systems Biology: Design Principles of Biological Circuits Uri Alon Presented by: Sharon Harel.
Networks FIAS Summer School 6th August 2008 Complex Networks 1.
Seminar in Bioinformatics, Winter 2011 Network Motifs
Clustering short time series gene expression data Jason Ernst, Gerard J. Nau and Ziv Bar-Joseph BIOINFORMATICS, vol
Network Motifs Zach Saul CS 289 Network Motifs: Simple Building Blocks of Complex Networks R. Milo et al.
Reverse Engineering of Regulatory Networks Ka-Lok Ng Department of Bioinformatics Asia University.
Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.
ANALYSIS OF GENETIC NETWORKS USING ATTRIBUTED GRAPH MATCHING.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Comparative Expression Moran Yassour +=. Goal Build a multi-species gene-coexpression network Find functions of unknown genes Discover how the genes.
Modeling the Gene Expression of Saccharomyces cerevisiae Δcin5 Under Cold Shock Conditions Kevin McKay Laura Terada Department of Biology Loyola Marymount.
Software Refactoring and Usability Enhancement for GRNmap, a Gene Regulatory Network Modeling Application Mathematical Model Equation 2. Equation 3. Future.
Systematic Analysis of Interactome: A New Trend in Bioinformatics KOCSEA Technical Symposium 2010 Young-Rae Cho, Ph.D. Assistant Professor Department of.
Formation of Regulatory Patterns During Signal Propagation in a Mammalian Cellular Network ROBERT D. BLITZER, RAVI IYENGAR.
Models of Influence in Online Social Networks
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology Advisor : Dr. Hsu Student : Sheng-Hsuan Wang Department.
Genetic network inference: from co-expression clustering to reverse engineering Patrik D’haeseleer,Shoudan Liang and Roland Somogyi.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
A COMPREHENSIVE GENE REGULATORY NETWORK FOR THE DIAUXIC SHIFT IN SACCHAROMYCES CEREVISIAE GEISTLINGER, L., CSABA, G., DIRMEIER, S., KÜFFNER, R., AND ZIMMER,
A Clustering Algorithm based on Graph Connectivity Balakrishna Thiagarajan Computer Science and Engineering State University of New York at Buffalo.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Changes in Gene Regulation in Δ Zap1 Strain of Saccharomyces cerevisiae due to Cold Shock Jim McDonald and Paul Magnano.
Data Analysis and GRNmap Testing Grace Johnson and Natalie Williams June 24, 2015.
Li Chen 4/3/2009 CSc 8910 Analysis of Biological Network, Spring 2009 Dr. Yi Pan.
IMPROVED RECONSTRUCTION OF IN SILICO GENE REGULATORY NETWORKS BY INTEGRATING KNOCKOUT AND PERTURBATION DATA Yip, K. Y., Alexander, R. P., Yan, K. K., &
Introduction to biological molecular networks
Modelling from Sequence to Gene Regulatory Network to Phenotype.
Examining the Genetic Similarity and Difference of the Three Progressor Groups at the First and Middle Visits Nicole Anguiano BIOL398: Bioinformatics Laboratory.
Nonlinear differential equation model for quantification of transcriptional regulation applied to microarray data of Saccharomyces cerevisiae Vu, T. T.,
Student: Trixie Anne M. Roque, Tessa A. Morris Faculty Mentors: Dr. Kam D. Dahlquist, Dr. Ben G. Fitzpatrick, & Dr. John David N. Dionisio SURP 2015 Final.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Inferring Regulatory Networks from Gene Expression Data BMI/CS 776 Mark Craven April 2002.
Multi-level predictive analytics and motif discovery across large dynamic spatiotemporal networks and in complex sociotechnical systems: An organizational.
Departments of Biology and Mathematics
Applications of graph theory in complex systems research
Time-Course Network Enrichment
Student: Trixie Anne M. Roque, Tessa A. Morris
Volume 8, Issue 4, Pages (April 2017)
FUNDAMENTAL CONCEPT OF ARTIFICIAL NETWORKS
Building and Analyzing Genome-Wide Gene Disruption Networks
Cold Adaptation in Budding Yeast
Modeling Nitrogen Metabolism in Yeast
1 Department of Engineering, 2 Department of Mathematics,
Inferred dynamic model of transcriptional regulatory network.
1 Department of Engineering, 2 Department of Mathematics,
(A) Graph depicting interaction between the five regulatory motifs measured by synergy and cooccurrence. (A) Graph depicting interaction between the five.
1 Department of Engineering, 2 Department of Mathematics,
Loyola Marymount University
Loyola Marymount University
CSCI2950-C Lecture 13 Network Motifs; Network Integration
MAPPFinder and You: An Introductory Presentation
Loyola Marymount Unviersity
Impulse Control: Temporal Dynamics in Gene Transcription
MAPPFinder and You: An Introductory Presentation
Anastasia Baryshnikova  Cell Systems 
Week 11 Assignment Figures
Mapping Global Histone Acetylation Patterns to Gene Expression
Volume 8, Issue 4, Pages (April 2017)
A Dynamic System Analysis of Simultaneous Recurrent Neural Network
Volume 37, Issue 6, Pages (December 2012)
Volume 4, Issue 3, Pages e3 (March 2017)
Predicting Gene Expression from Sequence
Dynamic regulatory map and static network for yeast response to AA starvation. Dynamic regulatory map and static network for yeast response to AA starvation.
The Systems Biology of Single-Cell Aging
Heterogeneous Boolean Networks with Two Totalistic Rules
Presentation transcript:

Ahnert, S. E., & Fink, T. M. A. (2016). Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties of their dynamical state space. Journal of The Royal Society Interface, 13(120), 20160179. Margaret J ONeil March 30, 2017 Department of Biology, Loyola Marymount University BIOL-398-05/S17

Outline Gene regulatory networks can be modeled and visualized in networks called graphs Boolean networks can be used to study dynamic properties and capabilities of a network Network motifs can be studied as Boolean functions and categorized based on their dynamical graph topologies The basin entropy and distinct cycle lengths were used to characterize dynamical space states of motifs Application to real-world networks suggests that fundamental topological properties of the state space are influencing evolution of regulatory networks

Outline Gene regulatory networks can be modeled and visualized in networks called graphs Boolean networks can be used to study dynamic properties and capabilities of a network Network motifs can be studied as Boolean functions and categorized based on their dynamical graph topologies The basin entropy and distinct cycle lengths were used to characterize dynamical space states of motifs Application to real-world networks suggests that fundamental topological properties of the state space are influencing evolution of regulatory networks

An Introduction to Networks To better visualize relationships between groups, clusters showing connections between individuals can be created These are called graphs or networks Most common form is a social network Individuals are represented as points called nodes Connections between individuals are shown as lines called edges

Networks can visualize biological relationships Gene regulatory networks (GRNs) can be visualized in graphs Nodes in these GRNs represent genes Edges represent regulatory relationships between genes Edges in GRNs are directed When weights are put on the edges, indicates activation (+) or repression (-)

Outline Gene regulatory networks can be modeled and visualized in networks called graphs Boolean networks can be used to study dynamic properties and capabilities of a network Network motifs can be studied as Boolean functions and categorized based on their dynamical graph topologies The basin entropy and distinct cycle lengths were used to characterize dynamical space states of motifs Application to real-world networks suggests that fundamental topological properties of the state space are influencing evolution of regulatory networks

Boolean networks can be used to explore relationships between dynamics, structure, form and function Network motifs are small subgraphs of directed networks Feed-forward loops are known to play an important role in gene regulatory networks A Boolean network is a directed network where each node has a binary state (0 or 1), and each node with input k inputs is associated with a string of 2k bits This string is called an update step which updates each nodes according to their Boolean function Authors of this paper note form and function of network motifs hasn’t been found to be related previously This paper differs from previous work by defining function of motifs in terms of structural properties of their attraction basins

Outline Gene regulatory networks can be modeled and visualized in networks called graphs Boolean networks can be used to study dynamic properties and capabilities of a network Network motifs can be studied as Boolean functions and categorized based on their dynamical graph topologies The basin entropy and distinct cycle lengths were used to characterize dynamical space states of motifs Application to real-world networks suggests that fundamental topological properties of the state space are influencing evolution of regulatory networks

Network motifs can be expressed and measured as Boolean networks

The topologically distinct motifs can be categorized based on number of feedback and feedforward loops Based on the 3-node motif, there are up to 9 possible edge connections, which results in 512 ways of connecting the nodes Eliminating repeats, this become 104 distinct ways Feed-forward loops and feedback loops were counted in each motif 4 categories of motif - No feed-forward, <2 feedback loops (pink) No feed-forward, 2-3 feedback loops (red) Feed-forward, <3 feedback loops (blue) Feed-forward, 3 feedback loops (purple)

Outline Gene regulatory networks can be modeled and visualized in networks called graphs Boolean networks can be used to study dynamic properties and capabilities of a network Network motifs can be studied as Boolean functions and categorized based on their dynamical graph topologies The basin entropy and distinct cycle lengths were used to characterize dynamical space states of motifs Application to real-world networks suggests that fundamental topological properties of the state space are influencing evolution of regulatory networks

Network categorization shows motifs fall into distinct groups based on their different cycle lengths Total different cycle lengths were found for each motif The four graphs show the location of the 4 different categories Motifs with a feed forward loop but without a 3-node feedback loop show the least cycle diversity No feed-forward and 2-3 node feedback loops are capable producing different dynamical behaviors

Network categorization shows motifs fall into distinct groups based on their average basin entropy Average basin entropy measures the fragmentation of the dynamical graphs of a motif Similar to the cycle lengths, when divided into categories, trends can be seen for each group Between C and Sav there is strong connection between certain structural characteristics of a motif and its dynamical behaviour.

Real-world regulatory and neural networks show the importance of the feed-forward loop The enrichment profiles for these networks are shown relative to a null model (a) The values of basin entropy show similar results to Z scores The total values of different cycle lengths follow a similar pattern to the z-scores and Sav Both Ct and Sav are shown on an inverted scale

Outline Gene regulatory networks can be modeled and visualized in networks called graphs Boolean networks can be used to study dynamic properties and capabilities of a network Network motifs can be studied as Boolean functions and categorized based on their dynamical graph topologies The basin entropy and distinct cycle lengths were used to characterize dynamical space states of motifs Application to real-world networks suggests that fundamental topological properties of the state space are influencing evolution of regulatory networks

Fundamental topological properties of the state-space influence the biological evolution of regulatory networks. Networks with a two-node feedback loop exhibited different dynamics from those containing a three-node feedback loop They had more in common with networks that had only a one-node feedback loop or none at all Feedback loops have been shown to occur in some regulatory networks, but only in small numbers in transcriptional networks The values of Sav and Ct both show a slight downwards trend (on the inverted scale) with increasing edge number in the motifs, whereas the motif z-scores show a slight upwards trend

Summary Gene regulatory networks can be modeled and visualized in networks called graphs Boolean networks can be used to study dynamic properties and capabilities of a network Network motifs can be studied as Boolean functions and categorized based on their dynamical graph topologies The basin entropy and distinct cycle lengths were used to characterize dynamical space states of motifs Application to real-world networks suggests that fundamental topological properties of the state space are influencing evolution of regulatory networks

Acknowledgments Dr. Dahlquist and Dr. Fitzpatrick for their guidance in this class and on the GRNmap project Colleagues from BIOL-398-05/S17

References Ahnert, S. E., & Fink, T. M. A. (2016). Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties of their dynamical state space. Journal of The Royal Society Interface, 13(120), 20160179. DOI: 10.1098/rsif.2016.0179 Dahlquist, Kam D. (2017) BIOL398-05/S17:Week 10. Retrieved from http://www.openwetware.org/wiki/BIOL398-05/S17:Week_10 on 28 March 2017.