Andy Yip, Steve Horvath Depts Human Genetics and Biostatistics, University of California, Los Angeles The Generalized Topological.

Slides:



Advertisements
Similar presentations
Gene Correlation Networks
Advertisements

Clustering Categorical Data The Case of Quran Verses
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Introduction to Bioinformatics
Important clustering methods used in microarray data analysis Steve Horvath Human Genetics and Biostatistics UCLA.
V4 Matrix algorithms and graph partitioning
C++ Programming: Program Design Including Data Structures, Third Edition Chapter 21: Graphs.
Seeing the forest for the trees : using the Gene Ontology to restructure hierarchical clustering Dikla Dotan-Cohen, Simon Kasif and Avraham A. Melkman.
Introduction to Bioinformatics Burkhard Morgenstern Institute of Microbiology and Genetics Department of Bioinformatics Goldschmidtstr. 1 Göttingen, March.
Modularity in Biological networks.  Hypothesis: Biological function are carried by discrete functional modules.  Hartwell, L.-H., Hopfield, J. J., Leibler,
Global topological properties of biological networks.
Modular Organization of Protein Interaction Network Feng Luo, Ph.D. Department of Computer Science Clemson University.
Steve Horvath University of California, Los Angeles
Graph, Search Algorithms Ka-Lok Ng Department of Bioinformatics Asia University.
Steve Horvath, Andy Yip Depts Human Genetics and Biostatistics, University of California, Los Angeles The Generalized Topological.
Is Forkhead Box N1 (FOXN1) significant in both men and women diagnosed with Chronic Fatigue Syndrome? Charlyn Suarez.
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Ulf Schmitz, Pattern recognition - Clustering1 Bioinformatics Pattern recognition - Clustering Ulf Schmitz
Is my network module preserved and reproducible? PloS Comp Biol. 7(1): e Steve Horvath Peter Langfelder University of California, Los Angeles.
Consensus eigengene networks: Studying relationships between gene co-expression modules across networks Peter Langfelder Dept. of Human Genetics, UC Los.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Flexible and Robust Co-Regularized Multi-Domain Graph Clustering Wei Cheng 1 Xiang Zhang 2 Zhishan Guo.
Systematic Analysis of Interactome: A New Trend in Bioinformatics KOCSEA Technical Symposium 2010 Young-Rae Cho, Ph.D. Assistant Professor Department of.
Microarray Gene Expression Data Analysis A.Venkatesh CBBL Functional Genomics Chapter: 07.
Ai Li and Steve Horvath Depts Human Genetics and Biostatistics, University of California, Los Angeles Generalizations of.
Network Analysis and Application Yao Fu
“An Extension of Weighted Gene Co-Expression Network Analysis to Include Signed Interactions” Michael Mason Department of Statistics, UCLA.
A Geometric Interpretation of Gene Co-Expression Network Analysis Steve Horvath, Jun Dong.
Bioinformatics Dealing with expression data Kristel Van Steen, PhD, ScD Université de Liege - Institut Montefiore
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Hierarchical Clustering and Dynamic Branch Cutting
Networks and Interactions Boo Virk v1.0.
General Prediction Strength Methods for Estimating the Number of Clusters in a Dataset Moira Regelson, Ph.D. September 15, 2005.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Expression Modules Brian S. Yandell (with slides from Steve Horvath, UCLA, and Mark Keller, UW-Madison)
Using Graph Theory to Study Neural Networks (Watrous, Tandon, Conner, Pieters & Ekstrom, 2012)
Network Construction “A General Framework for Weighted Gene Co-Expression Network Analysis” Steve Horvath Human Genetics and Biostatistics University of.
Dimension reduction : PCA and Clustering Slides by Agnieszka Juncker and Chris Workman modified by Hanne Jarmer.
Networks Igor Segota Statistical physics presentation.
Neural Networks - Lecture 81 Unsupervised competitive learning Particularities of unsupervised learning Data clustering Neural networks for clustering.
Top X interactions of PIN Network A interactions Coverage of Network A Figure S1 - Network A interactions are distributed evenly across the top 60,000.
Quantitative analysis of 2D gels Generalities. Applications Mutant / wild type Physiological conditions Tissue specific expression Disease / normal state.
A Visualization Model Based on Adjacency Data by Edward Condon Bruce Golden S. Lele S. Raghavan Edward Wasil Presented at Miami Beach INFORMS Conference.
More About Clustering Naomi Altman Nov '06. Assessing Clusters Some things we might like to do: 1.Understand the within cluster similarity and between.
Differential analysis of Eigengene Networks: Finding And Analyzing Shared Modules Across Multiple Microarray Datasets Peter Langfelder and Steve Horvath.
The new protocol of freenet Taken from Ian Clarke and Oskar Sandberg (The Freenet Project)
Understanding Network Concepts in Modules Dong J, Horvath S (2007) BMC Systems Biology 2007, 1:24.
Most of contents are provided by the website Graph Essentials TJTSD66: Advanced Topics in Social Media.
Lecture 3 1.Different centrality measures of nodes 2.Hierarchical Clustering 3.Line graphs.
Gene expression & Clustering. Determining gene function Sequence comparison tells us if a gene is similar to another gene, e.g., in a new species –Dynamic.
Graphs Basic properties.
CS 590 Term Project Epidemic model on Facebook
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Chapter 20: Graphs. Objectives In this chapter, you will: – Learn about graphs – Become familiar with the basic terminology of graph theory – Discover.
Network Partition –Finding modules of the network. Graph Clustering –Partition graphs according to the connectivity. –Nodes within a cluster is highly.
Hierarchical clustering approaches for high-throughput data Colin Dewey BMI/CS 576 Fall 2015.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Mining Coherent Dense Subgraphs across Multiple Biological Networks Vahid Mirjalili CSE 891.
Graph clustering to detect network modules
Fig. 1 Computing the four node TOMs for nodes A,B,C,D in two simple networks 1) tA,B,C,D=0+40+6=0.667 and 2) tA,B,C,D=1+41+6= From: Network neighborhood.
Spectral methods for Global Network Alignment
A General Framework for Weighted Gene Co-Expression Network Analysis
Community detection in graphs
Hierarchical clustering approaches for high-throughput data
Topological overlap matrix (TOM) plots of weighted, gene coexpression networks constructed from one mouse studies (A–F) and four human studies including.
Spectral methods for Global Network Alignment
Anastasia Baryshnikova  Cell Systems 
Volume 11, Issue 5, Pages (May 2015)
Volume 3, Issue 1, Pages (July 2016)
Brandon Ho, Anastasia Baryshnikova, Grant W. Brown  Cell Systems 
Presentation transcript:

Andy Yip, Steve Horvath Depts Human Genetics and Biostatistics, University of California, Los Angeles The Generalized Topological Overlap Matrix in Biological Network Analysis

Contents Dissimilarity measures in undirected networks Dissimilarities based on shared neighbors Generalized topological overlap matrix Applications Simulation

Network Terminology Unweighted Network=adjacency matrix A=[a ij ], that encodes whether a pair of nodes is connected. –A is a symmetric matrix with entries in [0,1] –a ij =1 nodes i and j are connected else 0 HERE WE CONSIDER AN UNWEIGHTED NETWORKS Gene connectivity K= row sum of the adjacency matrix=number of direct neighbors Network Module=Subset of highly interconnected nodes

Define an Adjacency Matrix Measure of Node Dissimilarity Identify Network Modules (Clustering) Understand the biological meaning of modules and network concepts Basic Steps in Many Biological Network Analyses

What is a node dissimilarity? And why do we need it? Mathematical Definition of a Dissimilarity measure 1) Symmetry: G(u,v)=G(v,u) 2) Non-negative G(u,v)>=0 3) G(u,u)=0 Major application: module detection Module=cluster of “similar” nodes Implementation: use the dissimilarity measure as input of a clustering procedure, e.g. average linkage hierarchical clustering, or partitioning around medoid clustering Aside: node dissimilarities have many other uses, e.g. to study how a node dissimilarity between 2 interacting genes changes across conditions…

Possible measures of node dissimilarity 1.Simply use 1 minus the adjacency matrix 2.Length of shortest path connecting 2 nodes 3.Our focus: measures based on number of shared neighbors –Intuition: if 2 people share the same friends they are close in a social network

Similarity based on number of shared neighbors

Standard Topological Overlap measure (Ravasz et al 2002) Generalization to unweighted networks discussed in Zhang and Horvath (2005). Generalization to multiple nodes defined in Ai Li, S Horvath (2006) Multinode topological overlap matrix.

The topological overlap measures interconnectedness for an unweighted network, one can show that the topological overlap=1 only if the node with fewer links satisfies two conditions: –(a) all of its neighbors are also neighbors of the other node, i.e. it is connected to all of the neighbors of the other node and –(b) it is linked to the other node. In contrast, top. overlap=0 if i and j are unlinked and the two nodes don't have common neighbors.

Our set theory interpretation of the topological overlap matrix

Generalizing the topological overlap matrix to 2 step neighborhoods etc Simply replace the neighborhoods by 2 step neighborhoods in the following formula Reference: Andy M. Yip and SH (2006) The Generalized Topological Overlap Matrix For Detecting Modules in Gene Networks.

Computationally simple calculation of GTOMm GTOMm can be directly calculated from A+A*A+A*A*A+A…..A where * denotes matrix mutiplication Computation time driven by m matrix multiplications of A

Summary: dissimilarity measures based on an adjacency matrix A

Defining Gene Modules =sets of tightly co-regulated genes

Module Identification based on the notion of topological overlap An important aim of metabolic network analysis is to detect subsets (modules) of nodes that are tightly connected to each other. We adopt the definition of Ravasz et al (2002): modules are groups of nodes that have high topological overlap.

Using the TOM matrix to cluster genes To group nodes with high topological overlap into modules (clusters), we typically use average linkage hierarchical clustering coupled with the TOM distance measure. Once a dendrogram is obtained from a hierarchical clustering method, we choose a height cutoff to arrive at a clustering. –Here modules correspond to branches of the dendrogram TOM plot Hierarchical clustering dendrogram TOM matrix Module: Correspond to branches Genes correspond to rows and columns

Comparison of 3 different similarities in capturing the functional class `protein biosynthesis'. (a) ADJ=GTOM0 (b) GTOM1 (c) GTOM2 The middle row shows the color bar ordered by the corresponding dendrogram but colored by the module assignment with respect to the TOM measure in (b), the bottom shows the color bar ordered by the corresponding dendrogram where genes belong to the class `protein biosynthesis' are colored in dark red. Almost all protein biosynthesis genes are grouped together by the GTOM2 measure whereas the other two measures tend to distribute the class over two modules.

Overall, modules are quite robust with respect to the GTOM measure. Smaller modules are more visible in GTOM0 and GTOM1 plots Larger modules are more pronounced in GTOM2 and GTOM3 plots ADJ=GTOM0 GTOM1 GTOM2 GTOM3 Topological Overlap Matrix Plots for different GTOM measures, yeast

Multidimensional Scaling Plots involving different GTOMs ADJ=GTOM0 GTOM1 GTOM2 GTOM3

Simple simulated example where GTOM2 is better than GTOM1 and GTOM0

Example, when GTOM2 is superior to GTOM1 or GTOM0 Top 8 GTOM2 neighbors of Node 1 are exactly Node 1 – Node 8. TOM1 neighbors of Node 1 are Node 1,4,5,8,9, Black circles: 8 closest GTOM1 neighbors of node 1

Predicting essential proteins in a fly network Idea: start with a single highly connected essential protein and consider its closest neighbors based on a dissimilarity measure One would hope that the most similar (closest) neighbors are also essential since they may be part of the same pathway Data protein-protein interaction data from Biogrid Essentiality: determined by knock-out experiments

GTOM2 outperforms GTOM1 and GTOM0 in the fly protein-protein network Y-axis proportion of essential genes amony the closest neighbors X-axis size of closest neighborhood

Since the topological overlap matrix considers shared neighbors, it tends to be more robust to spurious connections. Limitation of GTOM: it rquires an unweighted network (binary adjacencies) GTOM is based on pairwise overlap. In contrast, MTOM is based on multi-node overlap. Overall, GTOM0, GTOM1 and GTOM2 lead to similar clusters (modules). Our experience In most applications, we find that GTOM1 is better than GTOM0 Often GTOM1 performs better than GTOM2 But in the fly network GTOM2 is better than GTOM1 GTOMm with m>2 tends to lump nodes together  loss of resolution Discussion

Acknowledgement Biostatistics/Bioinformatics Ai Li, doctoral student UCLA (MTOM software) Jun Dong, Postdoc UCLA Wei Zhao, Postdoc UCLA Lin Wang Bin Zhang Collaborators Marc Carlson, Dan Geschwind, Paul Mischel, Stan Nelson, Mike Oldham, and many more

Webpages and References This talk and relevant R code Yip A, Horvath S (2006) The Generalized Topological Overlap Matrix For Detecting Modules in Gene Networks Proceedings Volume Gene Networks: Theory and Application Workshop at BIOCOMP'06, Las Vegas Ai Li, Steve Horvath (2006) The Multi-Point Topological Overlap Matrix for Gene Neighborhood Analysis. Proceedings Volume Gene Networks: Theory and Application Workshop at BIOCOMP'06, Las Vegas Bin Zhang and Steve Horvath (2005) "A General Framework for Weighted Gene Co-Expression Network Analysis", Statistical Applications in Genetics and Molecular Biology: Vol. 4: No. 1, Article Yeast Co-Expression Network MRJ Carlson, B Zhang, Z Fang, PS Mischel, S Horvath, SF Nelson, Gene connectivity, function, and sequence conservation: predictions from modular yeast co-expression networks", BMC Genomics 2006, 7:40 (3 March 2006).

Appendix