Nature Genetics 37, 77 - 83 (2004) Modular epistasis in yeast metabolism Daniel Segr � 1, Alexander DeLuna2, George M Church1 & Roy Kishony2.

Slides:



Advertisements
Similar presentations
Original Figures for "Molecular Classification of Cancer: Class Discovery and Class Prediction by Gene Expression Monitoring"
Advertisements

Predicting essential genes via impact degree on metabolic networks ISSSB’11 Takeyuki Tamura Bioinformatics Center, Institute for Chemical Research Kyoto.
11 Simple Linear Regression and Correlation CHAPTER OUTLINE
D ISCOVERING REGULATORY AND SIGNALLING CIRCUITS IN MOLECULAR INTERACTION NETWORK Ideker Bioinformatics 2002 Presented by: Omrit Zemach April Seminar.
Darwinian Genomics Csaba Pal Biological Research Center Szeged, Hungary.
Global Mapping of the Yeast Genetic Interaction Network Tong et. al, Science, Feb 2004 Presented by Bowen Cui.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Cluster Analysis.
Linkage Learning in Evolutionary Algorithms. Recombination Missouri University of Science and Technology Recombination explores the search space Classic.
The Structure, Function, and Evolution of Biological Systems Instructor: Van Savage Spring 2010 Quarter 4/6/2010.
The Structure, Function, and Evolution of Biological Systems Instructor: Van Savage Spring 2010 Quarter 4/1/2010.
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.
Evolution of minimal metabolic networks WANG Chao April 11, 2006.
Adaptive evolution of bacterial metabolic networks by horizontal gene transfer Chao Wang Dec 14, 2005.
Cluster Analysis.  What is Cluster Analysis?  Types of Data in Cluster Analysis  A Categorization of Major Clustering Methods  Partitioning Methods.
Experimental and computational assessment of conditionally essential genes in E. coli Chao WANG, Oct
Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,
Integrated analysis of regulatory and metabolic networks reveals novel regulatory mechanisms in Saccharomyces cerevisiae Speaker: Zhu YANG 6 th step, 2006.
Segmentation Graph-Theoretic Clustering.
Global topological properties of biological networks.
Basic Data Mining Techniques
OEB 192 – Optimality & evolution of 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.
Systems Biology, April 25 th 2007Thomas Skøt Jensen Technical University of Denmark Networks and Network Topology Thomas Skøt Jensen Center for Biological.
Comparative Expression Moran Yassour +=. Goal Build a multi-species gene-coexpression network Find functions of unknown genes Discover how the genes.
Modern Navigation Thomas Herring
2009 Mathematics Standards of Learning Training Institutes Algebra II Virginia Department of Education.
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
The Structure, Function, and Evolution of Biological Systems Instructor: Van Savage Spring 2010 Quarter 4/1/2010.
DNA microarray technology allows an individual to rapidly and quantitatively measure the expression levels of thousands of genes in a biological sample.
ANALYZING PROTEIN NETWORK ROBUSTNESS USING GRAPH SPECTRUM Jingchun Chen The Ohio State University, Columbus, Ohio Institute.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Network Biology Presentation by: Ansuman sahoo 10th semester
Investigation of the Effect of Neutrality on the Evolution of Digital Circuits. Eoin O’Grady Final year Electronic and Computer Engineering Project.
GATree: Genetically Evolved Decision Trees 전자전기컴퓨터공학과 데이터베이스 연구실 G 김태종.
BINOMIALDISTRIBUTION AND ITS APPLICATION. Binomial Distribution  The binomial probability density function –f(x) = n C x p x q n-x for x=0,1,2,3…,n for.
The Structure, Function, and Evolution of Vascular Systems Instructor: Van Savage Spring 2010 Quarter 3/30/2010.
Intel Confidential – Internal Only Co-clustering of biological networks and gene expression data Hanisch et al. This paper appears in: bioinformatics 2002.
1 Departament of Bioengineering, University of California 2 Harvard Medical School Department of Genetics Metabolic Flux Balance Analysis and the in Silico.
20. Lecture WS 2004/05Bioinformatics III1 V20 Applications of Flux Balance Analysis Many aspects of metabolism are currently being studied to understand.
Systems Biology ___ Toward System-level Understanding of Biological Systems Hou-Haifeng.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Mean, Variance, Moments and.
Understanding Network Concepts in Modules Dong J, Horvath S (2007) BMC Systems Biology 2007, 1:24.
IMPROVED RECONSTRUCTION OF IN SILICO GENE REGULATORY NETWORKS BY INTEGRATING KNOCKOUT AND PERTURBATION DATA Yip, K. Y., Alexander, R. P., Yan, K. K., &
Lecture 24: Quantitative Traits IV Date: 11/14/02  Sources of genetic variation additive dominance epistatic.
Genome Biology and Biotechnology The next frontier: Systems biology Prof. M. Zabeau Department of Plant Systems Biology Flanders Interuniversity Institute.
Data Mining Practical Machine Learning Tools and Techniques By I. H. Witten, E. Frank and M. A. Hall 6.8: Clustering Rodney Nielsen Many / most of these.
Molecular Classification of Cancer Class Discovery and Class Prediction by Gene Expression Monitoring.
CS 8625 High Performance Computing Dr. Hoganson Copyright © 2003, Dr. Ken Hoganson CS8625 Class Will Start Momentarily… CS8625 High Performance.
4 basic analytical tasks in statistics: 1)Comparing scores across groups  look for differences in means 2)Cross-tabulating categoric variables  look.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Determinants of Mutation Outcome Predicting mutation outcome from early stochastic variation in genetic interaction partners.
Advanced Gene Selection Algorithms Designed for Microarray Datasets Limitation of current feature selection methods: –Ignores gene/gene interaction: single.
Onlinedeeneislam.blogspot.com1 Design and Analysis of Algorithms Slide # 1 Download From
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Network applications Sushmita Roy BMI/CS 576 Dec 9 th, 2014.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Data Science Practical Machine Learning Tools and Techniques 6.8: Clustering Rodney Nielsen Many / most of these slides were adapted from: I. H. Witten,
Unsupervised Learning
Hyunghoon Cho, Bonnie Berger, Jian Peng  Cell Systems 
Biological networks CS 5263 Bioinformatics.
Learning with information of features
Basic Statistical Terms
Translation of Genotype to Phenotype by a Hierarchy of Cell Subsystems
Cluster Analysis.
Text Categorization Berlin Chen 2003 Reference:
Hyunghoon Cho, Bonnie Berger, Jian Peng  Cell Systems 
Unsupervised Learning
Presentation transcript:

Nature Genetics 37, (2004) Modular epistasis in yeast metabolism Daniel Segr � 1, Alexander DeLuna2, George M Church1 & Roy Kishony2

System-level organization of cellular metabolism GIs are also important from an evolutionary perspective Epistatic interactions are of particular importance for elucidating functional association between genes General Motivation

GIs: some properties  recent genome-wide screens for identifying pairs of synthetic- lethal mutations. Such extreme aggravating interactions comprise 0.5% of the gene pairs tested in the yeast and are correlated with functional association between genes.  Fundamental questions remain about the distribution of the sign and magnitude of epistatic interactions for the remaining 99.5% of the gene pairs.  the overall distribution of the level of interactions among random pairs of mutations is unimodal, roughly symmetric and centered near zero epistasis, despite frequent pairwise interactions.  Environmental factors were also shown to affect gene interactions.

The current investigation (1)  We studied the spectrum of epistatic interactions between metabolic genes in S. cerevisiae using the framework of flux balance analysis (FBA).  We calculated the maximal rate of biomass production (Vgrowth) of all the networks with single or double gene deletions relative to the rate of biomass production of the unperturbed wild-type network.  For the deletion of gene X, fitness was defined as Wx = V Xgrowth/Vwild−typegrowth.  We first analyzed the distribution of deviations from multiplicative behavior using a conventional nonscaled measure of epistatic interactions: Eps = WXY – WXWY.  This approach yielded a unimodal distribution of genetic interactions centered around = 0.

The current investigation (2)  We used a normalization based on two natural references: -- For aggravating interactions (Eps < 0), the extreme reference case was complete synthetic lethality: WXY’ = For alleviating (buffering) interactions (Eps > 0) we used WXY’ = min(WX,WY) - the special case in which the mutation with the stronger effect completely buffers the effect of the other mutation.  To obtain a new, normalized GI measure Eps’: Eps’ = Eps / |WXY’ – WxWy|.  Using the scaled measure of epistasis, the distribution of the epistasis level diverged into a trimodal distribution: buffering, aggravating and multiplicative.

GI distributions

Results (1)  we started with a supervised analysis of the total number of buffering and aggravating interactions between groups of genes defined by preassigned functional annotation.  Pairs of epistatically interacting genes were more likely to share the same annotation (21%).  The interactions between genes from 2 different annotations tend to be either exclusively buffering or exclusively aggravating!  This property, which we call 'monochromaticity' of interactions between gene sets, has a biological interpretation; the type of interaction of this module with others should not depend on the specific genes chosen in these modules.

Results (2)  Next, we determined whether it was possible to reorganize genes into modules that had no nonmonochromatic exceptions, using an unsupervised method (i.e., without taking into account existing information of gene annotation)  Towards this goal, we developed the Prism algorithm, which hierarchically clusters interacting genes into modules that have strictly monochromatic interconnections with each other.  We found that such a classification was achievable for the entire epistasis network of yeast metabolism.  The probability of Prism achieving such a monochromatic classification in a random network is very small (Pmodule < 10-3).  Genes with identical function could be grouped into the same module even in the absence of direct interaction between them

 Figure 3. Schematic description of the Prism algorithm. (a) The algorithm arranges a network of aggravating (red) and buffering (green) interactions into modules whose genes interact with one another in a strictly monochromatic way. This classification allows a system-level description of buffering and aggravating interactions between functional modules. Two networks with the same topology, but different permutations of link colors, can have different properties of monochromatic clusterability: permuting links 3−4 with 2−4 transforms a 'clusterable' graph (b) into a 'nonclusterable' one (c).

The Prism algorithm  Prism carries out a greedy agglomerative clustering, with the additional feature of avoiding, when possible, the generation of clusters that do not interact with each other monochromatically.  At the onset, each gene is assigned to a distinct cluster. In sequential clustering steps, pairs of clusters are combined until the whole network is covered.  At every step, each cluster pair (x,y) is assigned an integer Cx,y, counting how many nonmonochromatic connections would be formed if clusters x and y were joined (i.e., the number of clusters z that have buffering links with x and aggravating links with y, or vice versa), seeking for a minimal Cx,y.  The final clustering solution is assigned a total module- module monochromaticity violation number, Qmodule = Cm, where the sum is over all the clustering steps.

Conclusions (1)  Thus, we derived a system-level description of the network based on the new concept of epistasis between modules rather than between individual genes.  Most of the recovered modules and their connections are in good agreement with our understanding of yeast metabolism -- As expected, perturbations of the respiratory chain or the ATP synthetase would aggravate disruption of glycolysis.  Interactions that were not expected a priori provide interesting predictions of the model -- unidentified aggravating link between lysine biosynthesis and tryptophan degradation.

Conclusions (2)  The concept of monochromatic modularity extends the classical gene-gene definition of epistasis to the level of functional units.  a new definition of biological modularity, which emphasizes interconnections between modules and could complement approaches emphasizing intramodule properties.  It would be interesting to study the universality of the GI trimodal distribution.  Future extension of our monochromatic classification approach to networks with more than two colors.

The END

Table 1 – interactions definitions