SlideShare uma empresa Scribd logo
1 de 75
Baixar para ler offline
Interpretation of the biological
knowledge using networks approach
Elena Sügis
elena.sugis@.ut.ee
Bioinformatics for bioengineers LTTI.00.016, Spring 2018
lots of
experiments
v
analysis
Science
knowledge
hypothesis
v
v
lots of
experiments
v
analysis
Science
knowledge
hypothesis
v
v
Networks - the language of complex systems
Image 2 is adapted from http://www.jillkgregory.com/new-gallery-17/Image 1 is adapted from https://en.wikipedia.org/wiki/Complex_network
Image 2 is adapted from http://www.jillkgregory.com/new-gallery-17/
lots of
experiments
v
analysis
Science
knowledge
hypothesis
v
v
lots of
experiments
v
analysis
Science
knowledge
hypothesis
v
v
Networks-the language of complex systems
Image 1 is adapted from https://en.wikipedia.org/wiki/Complex_network
Networks are powerful tools
Analysis
• Topological properties
• Hubs and subnetworks
• Classify, cluster and diffuse
• Data integration
Visualization
• Data overlays
• Layouts and animation
• Exploratory analysis
• Context and interpretation
Image is adapted from Cassar, EMBO Reports 2015, Fig.8
• Reduce complexity

• More efficient than tables

• Great for data integration

• Intuitive visualization
Benefits of using networks
6
3
4
5
2
1
• NODES
• EDGES
Graphs are mathematical structure composed of set of objects
where pairs of the objects are connected by links
Networks can be built for any functional system
Networks - are graphs
• Genes
• Proteins
• Metabolites
• Enzymes
• Organisms
6
3
4
5
2
1
Nodes
The nodes in the networks represent related objects
Biological relationships:
• Interactions
• Regulations
• Reactions
• Transformations
• Activations
• Inhibitions
etc.
Edges
The edges in the network represent the type of relationship
between two entities
A B
A B
A B
A B
activates
binds to
has similar
sequence
co-cited
Edges
A B
A B
A B
directed
undirected
weighted
0,8
The architecture (or topology) of a network can be represented as
graph with links between the parts.
Image is adapted from https://www.systemsbiology.org/about/what-is-systems-biology/
Interactome
With networks, we can organize and integrate information at different levels
Networks in research
Pathways
NETWORKS PATHWAYS
Collection of binary interactions Human-curated, detailed
Large scale Small scale
Generated from omics data
Constructed from literature/domain
expert knowledge
A pathway is a series of actions among molecules in a cell that leads to a
certain product or a change in a cell.
You want to know:
- Type of relationships between genes
- Strength of relationship
- Functions of the related genes
- Pathways
- etc.
Gene list from
experiment
APP
PSEN1
FYN
MAPT
BIN1
EPHA1
EPHA2
PSEN
What network can tell you
What network can tell you
You can:
• Visually identify relationships among the group of
biological entities
• Find drag targets
• Identify overrepresented gene/protein functions
• Discover biological pathways
Alzheimer’s disease
• Series of molecular cancer
profiles
• Clinical, genomic, methylation,
RNA and proteomic signatures.
• Multiple data types integrated
into signalling network
• Includes patient sample-level
data
Image is adapted from TCGA (2013) Comprehensive molecular characterization of clear cell renal cell carcinoma. Nature, 499, Fig. 4
Networks application in research
Sources for network data
Data comes in different forms
Computational data -

results of the analysis
Raw data -
results of the experiments

Sequencing technologies
Mass spectrometry
healthy cell cancer cell
DNA
RNA
Protein
co-expression
differential
expression
DATA≠KNOWLEDGE
Big hairball
Big hairball
Nice and clear they say
Reduce complexity they say
Biological networks rarely tell us anything by themselves
Analysis involves:
• Understanding the characteristics of the network
• Modularity
• Comparison with other networks (i.e., random networks)
Visualization involves:
• Placing nodes in a meaningful way (layouts)
• Mapping biologically relevant data to the network
• Change node size, colour, edge weights, etc.

which allows better biological interpretation.
Making sense of the biological networks
Analysis
tools
Awesome resultData
Analysis pipeline
Network analysis tools
intro
medium
advanced
Network analysis tools
intro
medium
advanced
hands-on session
Cytoscape APPs zoo
Network properties
Global Network Properties
Local Network Properties
• Degree	distribu-on	
• Clustering	coefficient	
• Shortest	path	
• Centrali-es
• Network	mo-fs
Figure is adapted from https://cytoscape.github.io/cytoscape-tutorials/presentations/advanced-automation-2017-mpi.html#/11
Global Network
Properties
Degree distribution
Degree of a node is the number of edges incident to the node.
Degree distribution
Degree of a node is the number of edges incident to the node.
Degree distribution
Degree of a node is the number of edges incident to the node.
Degree distribution
Degree of a node is the number of edges incident to the node.
Degree distribution:
• Let P(k) be the percentage of nodes of degree k in the network.
The degree distribution is the distribution of P(k) over all k.
• P(k) can be understood as the probability that a node has degree k.
P(k) ~
e−λ
λk
k!
Image is adapted from E. Ravasz et al., Science, 2002
Degree distribution in scale-free networks
• Networks with power-law degree distributions are called scale-free
networks
• Most nodes are of low degree, but there is a small number of
highly-linked nodes (nodes of high degree) called “hubs.”
P(k) ~ k−γ
Image is adapted from E. Ravasz et al., Science, 2002
Clustering coefficient
Clustering coefficient is a measure of degree to which nodes in a
graph tend to cluster together.
Ci=2Ei/ki(ki-1)
ith node has ki neighbours linking with it
Ei is the actual number of links between ki neighbours
ki(ki-1)/2 maximal number of links between ki neighbours
Clustering coefficient of a vertex in a graph quantifies
how close its neighbours are to be a clique (complete
graph)
Clustering coefficient
Clustering coefficient is a measure of degree to which nodes in a
graph tend to cluster together.
Ci=2Ei/ki(ki-1)
ith node has ki neighbours linking with it
Ei is the actual number of links between ki neighbours
ki(ki-1)/2 maximal number of links between ki neighbours
Clustering coefficient of a vertex in a graph quantifies
how close its neighbours are to be a clique (complete
graph)
Clustering coefficient
Clustering coefficient is a measure of degree to which nodes in a
graph tend to cluster together.
Ci=2Ei/ki(ki-1)
ith node has ki neighbours linking with it
Ei is the actual number of links between ki neighbours
ki(ki-1)/2 maximal number of links between ki neighbours
Clustering coefficient of a vertex in a graph quantifies
how close its neighbours are to be a clique (complete
graph)
Clustering coefficient
Clustering coefficient is a measure of degree to which nodes in a
graph tend to cluster together.
Ci=2Ei/ki(ki-1)
ith node has ki neighbours linking with it
Ei is the actual number of links between ki neighbours
ki(ki-1)/2 maximal number of links between ki neighbours
Clustering coefficient of a vertex in a graph quantifies
how close its neighbours are to be a clique (complete
graph)
Clustering coefficient
Clustering coefficient is a measure of degree to which nodes in a
graph tend to cluster together.
Ci=2Ei/ki(ki-1)
ith node has ki neighbours linking with it
Ei is the actual number of links between ki neighbours
ki(ki-1)/2 maximal number of links between ki neighbours
Clustering coefficient of a vertex in a graph quantifies
how close its neighbours are to be a clique (complete
graph)
Hierarchical modularity
Many highly connected small clusters
combine into
few larger but less connected clusters
combine into
even larger and even less connected clusters
Clustering coefficient follows power-law distributionC(k) ~ k−β
Comparison of the network properties
Image is adapted from E. Ravasz et al., Science, 2002
C(k) ~ k−β
P(k) ~ k−γ
P(k) ~
e−λ
λk
k!
Shortest path
• Distance between two nodes is the smallest number of links that
have to be traversed to get from one node to the other.

Shortest path is the path that achieves that distance.

• Small world network is characterised by small average path length
l =
2
N(N −1)
lij
i<j
∑
lij is the shortest path length between node i and j
Defining important nodes in biological
networks
How would you define an important node?
Defining important nodes in biological
networks
the most connected?
connects other nodes in the network?
the closest to other nodes?
Centrality
Centrality quantifies the topological importance of a node (edge) in a network.
• Degree centrality defined number of
edges incident upon a node (find hubs).
C D (node) = Degree of this node



• Betweenness centrality indicates how
much load is on a node (bottleneck).
C B (node) = The average number of
shortest paths that go through this node


• Closeness centrality defines how close a
node is to all other nodes in the network.
C C (node) = Inverse of the average of the
shortest paths to all other nodes.
https://cytoscape.github.io/cytoscape-tutorials/presentations/modules/network-analysis/index.html#/0/6
Figure is partially adapted with modifications from original https://cytoscape.github.io/cytoscape-tutorials/presentations/modules/network-analysis/index.html#/0/6
How different centralities look
HUB
node that connect two sub-networks
closest node to all other nodes
Biological meaning
Degree centrality Closeness centralityBetweenness centrality
• Amount of control that
this node has over the
interactions of other
nodes in the network

• How much information
load is on the node

• Describes connectivity of
the network

• Nodes that connect two
sub-networks

• Can be calculated for
edges as well
• Nodes with a high
degree are also called
hub nodes

• Real networks have many
nodes with low degree
and few nodes with high
degree

• Nodes with a high
degree tend to be
essential nodes

• Regulatory elements like
transcription factors often
have a high out-degree
• Indication for how fast
information spreads from
a given node to other
reachable nodes in the
network
• The more central a node
is, the smaller is the
distance to all other
nodes, the higher is the
closeness
Material is adapted from BioSB 2015 Network Analysis Course
Brain connectivity
• A few regions that link the left and the right half of our brain
• They therefore have a high betweenness
AS. Panditet al, Cerebral Cortex (2014) Whole-brain mapping of structural connectivity in infants reveals altered connection strength associated with growth and preterm birth
Biological networks
• Free-scale networks (tend to have power-law degree
distribution)
• “Small world” networks (small average path length)

• Have hierarchical modularity property (have a high
clustering coefficient independent of network size)
• Robustness (have strong resistance to failure on random
attacks and vulnerable to targeted attacks)
Local Network
Properties
Pattern (sub-networks) that occurs more often than in randomised networks
Network motifs
Different types of network show different motifs. Gene regulatory
networks with transcription factors have typical regulation motifs.
Motifs in yeast regulatory network
Image is adapted from Lee et al. Transcriptional Regulatory Networks in Saccharomyces cerevisiae, Science 2002
Motifs in yeast regulatory network
• consists of a regulator
that binds to the
promoter region of its
own gene

• reduced response
time to environmental
stimuli

• decreased cost of
regulation

• increased stability of
gene expression
Motifs in yeast regulatory network
• consists of a
regulatory circuit
whose closure
involves two or more
factors 

• provides the capacity
for feedback control 

• offers the potential to
produce bistable
systems that can
switch between two
alternative states
Motifs in yeast regulatory network
• contains a regulator that
controls a second
regulator and both
regulators bind a common
target gene

• acts as a switch that is
designed to be sensitive
to sustained inputs 

• provides control of
expression of target gene
depending on the
accumulation of adequate
levels of the master and
secondary regulators
Motifs in yeast regulatory network
v
• contains a single regulator
that binds a set of genes
under a specific condition
• is responsible for some
particular biological
function
v
Motifs in yeast regulatory network
v
v
• set of regulators that bind
together to a set of genes
• coordinates gene
expression across a wide
variety of biological
conditions

• two different regulators
responding to two different
inputs allow coordinate
expression of the set of
genes under two different
conditions
Motifs in yeast regulatory network
v
• consists of chains of three
or more regulators in
which one regulator binds
the promoter for a second
regulator and so on
• simplest ordering of
transcriptional events

• regulators functioning at
one stage of the cell cycle
regulate the expression of
factors required for entry
into the next stage of the
cell cycle
Community detection
in biological networks
Community detection
Figure is adapted from original https://cytoscape.github.io/cytoscape-tutorials/presentations/advanced-automation-2017-mpi.html#/11
Identifying closely-related groups of nodes (modules/clusters)
• Based on topology
• Based on a shared function(s)
Hub-based modules
Module contains a node with high degree and its first neighbours
Clique modules
Module contains nodes that are all connected between each other
MCL-based modules
• Flow simulation based method
• Consider a graph with many links within a cluster, and fewer links
between clusters.
• This means if you were to start at a node, and then randomly travel
to a connected node, you’re more likely to stay within a cluster than
travel between.
• By doing random walks in the graph, it may be possible to discover.
where the flow tends to gather, and therefore, where clusters are
• Random Walks on a graph are calculated using “Markov Chains”.
Image is adapted from https://micans.org/mcl/
Betweenness-centrality based modules
Algorithm step-wise removes edges (nodes) with the highest betweenness-centrality
Quiz
Quiz
Quiz
Group functional
characterisation
Functional enrichment
Your gene

list
• Each module contains a list of genes.

• You want to know the biological story behind this module.
Functional characterisation
Identify biological function of the module
Cellular component
Molecular function
Biological process
Gene Ontology
KEGG
Reactome
Pathways
Regulation
miRBase miRNAs
TRANSFAC TF targets
Biogrid PPIs
CORUM protein complexes
Human Phenotype Ontology
Extra
Functional enrichment
Genes with
known

function x
?
Your gene

list
Functional enrichment
Does your gene list includes more
genes with function x than expected by
random chance?
Genes with
known

function x
?
Your gene

list
Tool for functional enrichment
http://biit.cs.ut.ee/gprofiler
J. Reimand, M. Kull, H. Peterson, J. Hansen, J. Vilo: g:Profiler - a web-based toolset for
functional profiling of gene lists from large-scale experiments (2007) NAR 35 W193-W200


Jüri Reimand, Tambet Arak, Priit Adler, Liis Kolberg, Sulev Reisberg, Hedi Peterson, Jaak
Vilo: g:Profiler -- a web server for functional interpretation of gene lists (2016 update)
Nucleic Acids Research 2016; doi: 10.1093/nar/gkw199
2175 modules found
Enrichment results for example module
https://biit.cs.ut.ee/graphweb/
Example of module functional
characterisation
Clustering based on enriched function
http://apps.cytoscape.org/apps/cluego
Questions & Answers
https://www.sli.do/ #P783
Ask a question Vote for a question
Open browser Go to www.slido.com Enter code #P783
4 5

Mais conteúdo relacionado

Mais procurados

RNA-seq for DE analysis: detecting differential expression - part 5
RNA-seq for DE analysis: detecting differential expression - part 5RNA-seq for DE analysis: detecting differential expression - part 5
RNA-seq for DE analysis: detecting differential expression - part 5BITS
 
Biomarker ppts of cnu
Biomarker ppts of cnuBiomarker ppts of cnu
Biomarker ppts of cnusravanponnam
 
Chapter 1 cancer genome
Chapter 1 cancer genomeChapter 1 cancer genome
Chapter 1 cancer genomeNilesh Kucha
 
Protein Modeling Overview
Protein Modeling OverviewProtein Modeling Overview
Protein Modeling OverviewSyed Lokman
 
Protein motif By KK Sahu Sir
Protein motif By KK Sahu SirProtein motif By KK Sahu Sir
Protein motif By KK Sahu SirKAUSHAL SAHU
 
What do we know about the h index?
What do we know about the h index?What do we know about the h index?
What do we know about the h index?hsls
 
Sequence homology search and multiple sequence alignment(1)
Sequence homology search and multiple sequence alignment(1)Sequence homology search and multiple sequence alignment(1)
Sequence homology search and multiple sequence alignment(1)AnkitTiwari354
 
Cheminformatics
CheminformaticsCheminformatics
Cheminformaticsbaoilleach
 
GENOMICS AND BIOINFORMATICS
GENOMICS AND BIOINFORMATICSGENOMICS AND BIOINFORMATICS
GENOMICS AND BIOINFORMATICSsandeshGM
 
The Gene Ontology & Gene Ontology Annotation resources
The Gene Ontology & Gene Ontology Annotation resourcesThe Gene Ontology & Gene Ontology Annotation resources
The Gene Ontology & Gene Ontology Annotation resourcesMelanie Courtot
 
FastQC and Prinseqlite
FastQC and PrinseqliteFastQC and Prinseqlite
FastQC and PrinseqliteRavi Gandham
 

Mais procurados (20)

prediction methods for ORF
prediction methods for ORFprediction methods for ORF
prediction methods for ORF
 
RNA-seq for DE analysis: detecting differential expression - part 5
RNA-seq for DE analysis: detecting differential expression - part 5RNA-seq for DE analysis: detecting differential expression - part 5
RNA-seq for DE analysis: detecting differential expression - part 5
 
Biomarker ppts of cnu
Biomarker ppts of cnuBiomarker ppts of cnu
Biomarker ppts of cnu
 
Genome analysis2
Genome analysis2Genome analysis2
Genome analysis2
 
Chapter 1 cancer genome
Chapter 1 cancer genomeChapter 1 cancer genome
Chapter 1 cancer genome
 
Dot matrix seminar
Dot matrix seminarDot matrix seminar
Dot matrix seminar
 
String.pptx
String.pptxString.pptx
String.pptx
 
Protein Modeling Overview
Protein Modeling OverviewProtein Modeling Overview
Protein Modeling Overview
 
Protein motif By KK Sahu Sir
Protein motif By KK Sahu SirProtein motif By KK Sahu Sir
Protein motif By KK Sahu Sir
 
What do we know about the h index?
What do we know about the h index?What do we know about the h index?
What do we know about the h index?
 
Sequence homology search and multiple sequence alignment(1)
Sequence homology search and multiple sequence alignment(1)Sequence homology search and multiple sequence alignment(1)
Sequence homology search and multiple sequence alignment(1)
 
Blast
BlastBlast
Blast
 
Cheminformatics
CheminformaticsCheminformatics
Cheminformatics
 
GENOMICS AND BIOINFORMATICS
GENOMICS AND BIOINFORMATICSGENOMICS AND BIOINFORMATICS
GENOMICS AND BIOINFORMATICS
 
Chemoinformatics.ppt
Chemoinformatics.pptChemoinformatics.ppt
Chemoinformatics.ppt
 
The Gene Ontology & Gene Ontology Annotation resources
The Gene Ontology & Gene Ontology Annotation resourcesThe Gene Ontology & Gene Ontology Annotation resources
The Gene Ontology & Gene Ontology Annotation resources
 
Protein structure prediction with a focus on Rosetta
Protein structure prediction with a focus on RosettaProtein structure prediction with a focus on Rosetta
Protein structure prediction with a focus on Rosetta
 
FastQC and Prinseqlite
FastQC and PrinseqliteFastQC and Prinseqlite
FastQC and Prinseqlite
 
Systems biology
Systems biologySystems biology
Systems biology
 
The Cancer Genome Atlas Update
The Cancer Genome Atlas UpdateThe Cancer Genome Atlas Update
The Cancer Genome Atlas Update
 

Semelhante a Interpretation of the biological knowledge using networks approach

Socialnetworkanalysis (Tin180 Com)
Socialnetworkanalysis (Tin180 Com)Socialnetworkanalysis (Tin180 Com)
Socialnetworkanalysis (Tin180 Com)Tin180 VietNam
 
Disintegration of the small world property with increasing diversity of chemi...
Disintegration of the small world property with increasing diversity of chemi...Disintegration of the small world property with increasing diversity of chemi...
Disintegration of the small world property with increasing diversity of chemi...N. Sukumar
 
Topology ppt
Topology pptTopology ppt
Topology pptboocse11
 
Using spectral radius ratio for node degree
Using spectral radius ratio for node degreeUsing spectral radius ratio for node degree
Using spectral radius ratio for node degreeIJCNCJournal
 
Higher-order clustering coefficients at Purdue CSoI
Higher-order clustering coefficients at Purdue CSoIHigher-order clustering coefficients at Purdue CSoI
Higher-order clustering coefficients at Purdue CSoIAustin Benson
 
Mining and analyzing social media part 2 - hicss47 tutorial - dave king
Mining and analyzing social media   part 2 - hicss47 tutorial - dave kingMining and analyzing social media   part 2 - hicss47 tutorial - dave king
Mining and analyzing social media part 2 - hicss47 tutorial - dave kingDave King
 
Simplicial closure & higher-order link prediction
Simplicial closure & higher-order link predictionSimplicial closure & higher-order link prediction
Simplicial closure & higher-order link predictionAustin Benson
 
Scott Complex Networks
Scott Complex NetworksScott Complex Networks
Scott Complex Networksjilung hsieh
 
Higher-order clustering coefficients
Higher-order clustering coefficientsHigher-order clustering coefficients
Higher-order clustering coefficientsAustin Benson
 
Higher-order Link Prediction GraphEx
Higher-order Link Prediction GraphExHigher-order Link Prediction GraphEx
Higher-order Link Prediction GraphExAustin Benson
 
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSEVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSijcsit
 
Exploratory social network analysis with pajek
Exploratory social network analysis with pajekExploratory social network analysis with pajek
Exploratory social network analysis with pajekTHomas Plotkowiak
 
An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...
An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...
An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...ijitcs
 
The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics
The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics
The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics Kolja Kleineberg
 
Ripple Algorithm to Evaluate the Importance of Network Nodes
Ripple Algorithm to Evaluate the Importance of Network NodesRipple Algorithm to Evaluate the Importance of Network Nodes
Ripple Algorithm to Evaluate the Importance of Network Nodesrahulmonikasharma
 
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITY
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITYCORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITY
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITYijfcstjournal
 

Semelhante a Interpretation of the biological knowledge using networks approach (20)

Socialnetworkanalysis (Tin180 Com)
Socialnetworkanalysis (Tin180 Com)Socialnetworkanalysis (Tin180 Com)
Socialnetworkanalysis (Tin180 Com)
 
Topology ppt
Topology pptTopology ppt
Topology ppt
 
Disintegration of the small world property with increasing diversity of chemi...
Disintegration of the small world property with increasing diversity of chemi...Disintegration of the small world property with increasing diversity of chemi...
Disintegration of the small world property with increasing diversity of chemi...
 
Topology ppt
Topology pptTopology ppt
Topology ppt
 
Topology ppt
Topology pptTopology ppt
Topology ppt
 
TopologyPPT.ppt
TopologyPPT.pptTopologyPPT.ppt
TopologyPPT.ppt
 
Using spectral radius ratio for node degree
Using spectral radius ratio for node degreeUsing spectral radius ratio for node degree
Using spectral radius ratio for node degree
 
Higher-order clustering coefficients at Purdue CSoI
Higher-order clustering coefficients at Purdue CSoIHigher-order clustering coefficients at Purdue CSoI
Higher-order clustering coefficients at Purdue CSoI
 
Mining and analyzing social media part 2 - hicss47 tutorial - dave king
Mining and analyzing social media   part 2 - hicss47 tutorial - dave kingMining and analyzing social media   part 2 - hicss47 tutorial - dave king
Mining and analyzing social media part 2 - hicss47 tutorial - dave king
 
D1803022335
D1803022335D1803022335
D1803022335
 
Simplicial closure & higher-order link prediction
Simplicial closure & higher-order link predictionSimplicial closure & higher-order link prediction
Simplicial closure & higher-order link prediction
 
Scott Complex Networks
Scott Complex NetworksScott Complex Networks
Scott Complex Networks
 
Higher-order clustering coefficients
Higher-order clustering coefficientsHigher-order clustering coefficients
Higher-order clustering coefficients
 
Higher-order Link Prediction GraphEx
Higher-order Link Prediction GraphExHigher-order Link Prediction GraphEx
Higher-order Link Prediction GraphEx
 
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSEVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKS
 
Exploratory social network analysis with pajek
Exploratory social network analysis with pajekExploratory social network analysis with pajek
Exploratory social network analysis with pajek
 
An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...
An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...
An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...
 
The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics
The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics
The Hidden Geometry of Multiplex Networks @ Next Generation Network Analytics
 
Ripple Algorithm to Evaluate the Importance of Network Nodes
Ripple Algorithm to Evaluate the Importance of Network NodesRipple Algorithm to Evaluate the Importance of Network Nodes
Ripple Algorithm to Evaluate the Importance of Network Nodes
 
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITY
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITYCORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITY
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITY
 

Mais de Elena Sügis

Tehisintellekti rakendused kõrghariduses: võimalused ja väljakutsed
Tehisintellekti rakendused kõrghariduses:  võimalused ja väljakutsedTehisintellekti rakendused kõrghariduses:  võimalused ja väljakutsed
Tehisintellekti rakendused kõrghariduses: võimalused ja väljakutsedElena Sügis
 
Miks on äge teadlane olla?
Miks on äge teadlane olla?Miks on äge teadlane olla?
Miks on äge teadlane olla?Elena Sügis
 
Practice discovering biological knowledge using networks approach.
Practice discovering biological knowledge using networks approach.Practice discovering biological knowledge using networks approach.
Practice discovering biological knowledge using networks approach.Elena Sügis
 
Bioinformaticians to the resque
Bioinformaticians to the resqueBioinformaticians to the resque
Bioinformaticians to the resqueElena Sügis
 
Basics of Data Analysis in Bioinformatics
Basics of Data Analysis in BioinformaticsBasics of Data Analysis in Bioinformatics
Basics of Data Analysis in BioinformaticsElena Sügis
 
Introduction to Bioinformatics.
 Introduction to Bioinformatics. Introduction to Bioinformatics.
Introduction to Bioinformatics.Elena Sügis
 
Data preprocessing and unsupervised learning methods in Bioinformatics
Data preprocessing and unsupervised learning methods in BioinformaticsData preprocessing and unsupervised learning methods in Bioinformatics
Data preprocessing and unsupervised learning methods in BioinformaticsElena Sügis
 

Mais de Elena Sügis (8)

Tehisintellekti rakendused kõrghariduses: võimalused ja väljakutsed
Tehisintellekti rakendused kõrghariduses:  võimalused ja väljakutsedTehisintellekti rakendused kõrghariduses:  võimalused ja väljakutsed
Tehisintellekti rakendused kõrghariduses: võimalused ja väljakutsed
 
Miks on äge teadlane olla?
Miks on äge teadlane olla?Miks on äge teadlane olla?
Miks on äge teadlane olla?
 
Practice discovering biological knowledge using networks approach.
Practice discovering biological knowledge using networks approach.Practice discovering biological knowledge using networks approach.
Practice discovering biological knowledge using networks approach.
 
Bioinformaticians to the resque
Bioinformaticians to the resqueBioinformaticians to the resque
Bioinformaticians to the resque
 
Basics of Data Analysis in Bioinformatics
Basics of Data Analysis in BioinformaticsBasics of Data Analysis in Bioinformatics
Basics of Data Analysis in Bioinformatics
 
Introduction to Bioinformatics.
 Introduction to Bioinformatics. Introduction to Bioinformatics.
Introduction to Bioinformatics.
 
Study IT in UT
Study IT in UTStudy IT in UT
Study IT in UT
 
Data preprocessing and unsupervised learning methods in Bioinformatics
Data preprocessing and unsupervised learning methods in BioinformaticsData preprocessing and unsupervised learning methods in Bioinformatics
Data preprocessing and unsupervised learning methods in Bioinformatics
 

Último

Daily Lesson Plan in Mathematics Quarter 4
Daily Lesson Plan in Mathematics Quarter 4Daily Lesson Plan in Mathematics Quarter 4
Daily Lesson Plan in Mathematics Quarter 4JOYLYNSAMANIEGO
 
THEORIES OF ORGANIZATION-PUBLIC ADMINISTRATION
THEORIES OF ORGANIZATION-PUBLIC ADMINISTRATIONTHEORIES OF ORGANIZATION-PUBLIC ADMINISTRATION
THEORIES OF ORGANIZATION-PUBLIC ADMINISTRATIONHumphrey A Beña
 
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdfGrade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdfJemuel Francisco
 
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSGRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSJoshuaGantuangco2
 
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...Nguyen Thanh Tu Collection
 
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfInclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfTechSoup
 
Influencing policy (training slides from Fast Track Impact)
Influencing policy (training slides from Fast Track Impact)Influencing policy (training slides from Fast Track Impact)
Influencing policy (training slides from Fast Track Impact)Mark Reed
 
ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4MiaBumagat1
 
How to do quick user assign in kanban in Odoo 17 ERP
How to do quick user assign in kanban in Odoo 17 ERPHow to do quick user assign in kanban in Odoo 17 ERP
How to do quick user assign in kanban in Odoo 17 ERPCeline George
 
Field Attribute Index Feature in Odoo 17
Field Attribute Index Feature in Odoo 17Field Attribute Index Feature in Odoo 17
Field Attribute Index Feature in Odoo 17Celine George
 
The Contemporary World: The Globalization of World Politics
The Contemporary World: The Globalization of World PoliticsThe Contemporary World: The Globalization of World Politics
The Contemporary World: The Globalization of World PoliticsRommel Regala
 
Textual Evidence in Reading and Writing of SHS
Textual Evidence in Reading and Writing of SHSTextual Evidence in Reading and Writing of SHS
Textual Evidence in Reading and Writing of SHSMae Pangan
 
4.16.24 Poverty and Precarity--Desmond.pptx
4.16.24 Poverty and Precarity--Desmond.pptx4.16.24 Poverty and Precarity--Desmond.pptx
4.16.24 Poverty and Precarity--Desmond.pptxmary850239
 
Expanded definition: technical and operational
Expanded definition: technical and operationalExpanded definition: technical and operational
Expanded definition: technical and operationalssuser3e220a
 
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...Postal Advocate Inc.
 
Oppenheimer Film Discussion for Philosophy and Film
Oppenheimer Film Discussion for Philosophy and FilmOppenheimer Film Discussion for Philosophy and Film
Oppenheimer Film Discussion for Philosophy and FilmStan Meyer
 
4.18.24 Movement Legacies, Reflection, and Review.pptx
4.18.24 Movement Legacies, Reflection, and Review.pptx4.18.24 Movement Legacies, Reflection, and Review.pptx
4.18.24 Movement Legacies, Reflection, and Review.pptxmary850239
 
ICS2208 Lecture6 Notes for SL spaces.pdf
ICS2208 Lecture6 Notes for SL spaces.pdfICS2208 Lecture6 Notes for SL spaces.pdf
ICS2208 Lecture6 Notes for SL spaces.pdfVanessa Camilleri
 
EMBODO Lesson Plan Grade 9 Law of Sines.docx
EMBODO Lesson Plan Grade 9 Law of Sines.docxEMBODO Lesson Plan Grade 9 Law of Sines.docx
EMBODO Lesson Plan Grade 9 Law of Sines.docxElton John Embodo
 

Último (20)

Daily Lesson Plan in Mathematics Quarter 4
Daily Lesson Plan in Mathematics Quarter 4Daily Lesson Plan in Mathematics Quarter 4
Daily Lesson Plan in Mathematics Quarter 4
 
THEORIES OF ORGANIZATION-PUBLIC ADMINISTRATION
THEORIES OF ORGANIZATION-PUBLIC ADMINISTRATIONTHEORIES OF ORGANIZATION-PUBLIC ADMINISTRATION
THEORIES OF ORGANIZATION-PUBLIC ADMINISTRATION
 
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdfGrade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
Grade 9 Quarter 4 Dll Grade 9 Quarter 4 DLL.pdf
 
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSGRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
 
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptxYOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
 
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
 
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfInclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
 
Influencing policy (training slides from Fast Track Impact)
Influencing policy (training slides from Fast Track Impact)Influencing policy (training slides from Fast Track Impact)
Influencing policy (training slides from Fast Track Impact)
 
ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4
 
How to do quick user assign in kanban in Odoo 17 ERP
How to do quick user assign in kanban in Odoo 17 ERPHow to do quick user assign in kanban in Odoo 17 ERP
How to do quick user assign in kanban in Odoo 17 ERP
 
Field Attribute Index Feature in Odoo 17
Field Attribute Index Feature in Odoo 17Field Attribute Index Feature in Odoo 17
Field Attribute Index Feature in Odoo 17
 
The Contemporary World: The Globalization of World Politics
The Contemporary World: The Globalization of World PoliticsThe Contemporary World: The Globalization of World Politics
The Contemporary World: The Globalization of World Politics
 
Textual Evidence in Reading and Writing of SHS
Textual Evidence in Reading and Writing of SHSTextual Evidence in Reading and Writing of SHS
Textual Evidence in Reading and Writing of SHS
 
4.16.24 Poverty and Precarity--Desmond.pptx
4.16.24 Poverty and Precarity--Desmond.pptx4.16.24 Poverty and Precarity--Desmond.pptx
4.16.24 Poverty and Precarity--Desmond.pptx
 
Expanded definition: technical and operational
Expanded definition: technical and operationalExpanded definition: technical and operational
Expanded definition: technical and operational
 
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
USPS® Forced Meter Migration - How to Know if Your Postage Meter Will Soon be...
 
Oppenheimer Film Discussion for Philosophy and Film
Oppenheimer Film Discussion for Philosophy and FilmOppenheimer Film Discussion for Philosophy and Film
Oppenheimer Film Discussion for Philosophy and Film
 
4.18.24 Movement Legacies, Reflection, and Review.pptx
4.18.24 Movement Legacies, Reflection, and Review.pptx4.18.24 Movement Legacies, Reflection, and Review.pptx
4.18.24 Movement Legacies, Reflection, and Review.pptx
 
ICS2208 Lecture6 Notes for SL spaces.pdf
ICS2208 Lecture6 Notes for SL spaces.pdfICS2208 Lecture6 Notes for SL spaces.pdf
ICS2208 Lecture6 Notes for SL spaces.pdf
 
EMBODO Lesson Plan Grade 9 Law of Sines.docx
EMBODO Lesson Plan Grade 9 Law of Sines.docxEMBODO Lesson Plan Grade 9 Law of Sines.docx
EMBODO Lesson Plan Grade 9 Law of Sines.docx
 

Interpretation of the biological knowledge using networks approach

  • 1. Interpretation of the biological knowledge using networks approach Elena Sügis elena.sugis@.ut.ee Bioinformatics for bioengineers LTTI.00.016, Spring 2018
  • 2. lots of experiments v analysis Science knowledge hypothesis v v lots of experiments v analysis Science knowledge hypothesis v v Networks - the language of complex systems Image 2 is adapted from http://www.jillkgregory.com/new-gallery-17/Image 1 is adapted from https://en.wikipedia.org/wiki/Complex_network
  • 3. Image 2 is adapted from http://www.jillkgregory.com/new-gallery-17/ lots of experiments v analysis Science knowledge hypothesis v v lots of experiments v analysis Science knowledge hypothesis v v Networks-the language of complex systems Image 1 is adapted from https://en.wikipedia.org/wiki/Complex_network
  • 4. Networks are powerful tools Analysis • Topological properties • Hubs and subnetworks • Classify, cluster and diffuse • Data integration Visualization • Data overlays • Layouts and animation • Exploratory analysis • Context and interpretation Image is adapted from Cassar, EMBO Reports 2015, Fig.8
  • 5. • Reduce complexity
 • More efficient than tables
 • Great for data integration
 • Intuitive visualization Benefits of using networks
  • 6. 6 3 4 5 2 1 • NODES • EDGES Graphs are mathematical structure composed of set of objects where pairs of the objects are connected by links Networks can be built for any functional system Networks - are graphs
  • 7. • Genes • Proteins • Metabolites • Enzymes • Organisms 6 3 4 5 2 1 Nodes The nodes in the networks represent related objects
  • 8. Biological relationships: • Interactions • Regulations • Reactions • Transformations • Activations • Inhibitions etc. Edges The edges in the network represent the type of relationship between two entities A B A B A B A B activates binds to has similar sequence co-cited
  • 9. Edges A B A B A B directed undirected weighted 0,8 The architecture (or topology) of a network can be represented as graph with links between the parts.
  • 10. Image is adapted from https://www.systemsbiology.org/about/what-is-systems-biology/ Interactome With networks, we can organize and integrate information at different levels
  • 12. Pathways NETWORKS PATHWAYS Collection of binary interactions Human-curated, detailed Large scale Small scale Generated from omics data Constructed from literature/domain expert knowledge A pathway is a series of actions among molecules in a cell that leads to a certain product or a change in a cell.
  • 13. You want to know: - Type of relationships between genes - Strength of relationship - Functions of the related genes - Pathways - etc. Gene list from experiment APP PSEN1 FYN MAPT BIN1 EPHA1 EPHA2 PSEN What network can tell you
  • 14. What network can tell you You can: • Visually identify relationships among the group of biological entities • Find drag targets • Identify overrepresented gene/protein functions • Discover biological pathways Alzheimer’s disease
  • 15. • Series of molecular cancer profiles • Clinical, genomic, methylation, RNA and proteomic signatures. • Multiple data types integrated into signalling network • Includes patient sample-level data Image is adapted from TCGA (2013) Comprehensive molecular characterization of clear cell renal cell carcinoma. Nature, 499, Fig. 4 Networks application in research
  • 17. Data comes in different forms Computational data -
 results of the analysis Raw data - results of the experiments
 Sequencing technologies Mass spectrometry healthy cell cancer cell DNA RNA Protein co-expression differential expression
  • 18.
  • 21. Big hairball Nice and clear they say Reduce complexity they say
  • 22. Biological networks rarely tell us anything by themselves Analysis involves: • Understanding the characteristics of the network • Modularity • Comparison with other networks (i.e., random networks) Visualization involves: • Placing nodes in a meaningful way (layouts) • Mapping biologically relevant data to the network • Change node size, colour, edge weights, etc.
 which allows better biological interpretation. Making sense of the biological networks
  • 27. Network properties Global Network Properties Local Network Properties • Degree distribu-on • Clustering coefficient • Shortest path • Centrali-es • Network mo-fs Figure is adapted from https://cytoscape.github.io/cytoscape-tutorials/presentations/advanced-automation-2017-mpi.html#/11
  • 29. Degree distribution Degree of a node is the number of edges incident to the node.
  • 30. Degree distribution Degree of a node is the number of edges incident to the node.
  • 31. Degree distribution Degree of a node is the number of edges incident to the node.
  • 32. Degree distribution Degree of a node is the number of edges incident to the node. Degree distribution: • Let P(k) be the percentage of nodes of degree k in the network. The degree distribution is the distribution of P(k) over all k. • P(k) can be understood as the probability that a node has degree k. P(k) ~ e−λ λk k! Image is adapted from E. Ravasz et al., Science, 2002
  • 33. Degree distribution in scale-free networks • Networks with power-law degree distributions are called scale-free networks • Most nodes are of low degree, but there is a small number of highly-linked nodes (nodes of high degree) called “hubs.” P(k) ~ k−γ Image is adapted from E. Ravasz et al., Science, 2002
  • 34. Clustering coefficient Clustering coefficient is a measure of degree to which nodes in a graph tend to cluster together. Ci=2Ei/ki(ki-1) ith node has ki neighbours linking with it Ei is the actual number of links between ki neighbours ki(ki-1)/2 maximal number of links between ki neighbours Clustering coefficient of a vertex in a graph quantifies how close its neighbours are to be a clique (complete graph)
  • 35. Clustering coefficient Clustering coefficient is a measure of degree to which nodes in a graph tend to cluster together. Ci=2Ei/ki(ki-1) ith node has ki neighbours linking with it Ei is the actual number of links between ki neighbours ki(ki-1)/2 maximal number of links between ki neighbours Clustering coefficient of a vertex in a graph quantifies how close its neighbours are to be a clique (complete graph)
  • 36. Clustering coefficient Clustering coefficient is a measure of degree to which nodes in a graph tend to cluster together. Ci=2Ei/ki(ki-1) ith node has ki neighbours linking with it Ei is the actual number of links between ki neighbours ki(ki-1)/2 maximal number of links between ki neighbours Clustering coefficient of a vertex in a graph quantifies how close its neighbours are to be a clique (complete graph)
  • 37. Clustering coefficient Clustering coefficient is a measure of degree to which nodes in a graph tend to cluster together. Ci=2Ei/ki(ki-1) ith node has ki neighbours linking with it Ei is the actual number of links between ki neighbours ki(ki-1)/2 maximal number of links between ki neighbours Clustering coefficient of a vertex in a graph quantifies how close its neighbours are to be a clique (complete graph)
  • 38. Clustering coefficient Clustering coefficient is a measure of degree to which nodes in a graph tend to cluster together. Ci=2Ei/ki(ki-1) ith node has ki neighbours linking with it Ei is the actual number of links between ki neighbours ki(ki-1)/2 maximal number of links between ki neighbours Clustering coefficient of a vertex in a graph quantifies how close its neighbours are to be a clique (complete graph)
  • 39. Hierarchical modularity Many highly connected small clusters combine into few larger but less connected clusters combine into even larger and even less connected clusters Clustering coefficient follows power-law distributionC(k) ~ k−β
  • 40. Comparison of the network properties Image is adapted from E. Ravasz et al., Science, 2002 C(k) ~ k−β P(k) ~ k−γ P(k) ~ e−λ λk k!
  • 41. Shortest path • Distance between two nodes is the smallest number of links that have to be traversed to get from one node to the other.
 Shortest path is the path that achieves that distance.
 • Small world network is characterised by small average path length l = 2 N(N −1) lij i<j ∑ lij is the shortest path length between node i and j
  • 42. Defining important nodes in biological networks How would you define an important node?
  • 43. Defining important nodes in biological networks the most connected? connects other nodes in the network? the closest to other nodes?
  • 44. Centrality Centrality quantifies the topological importance of a node (edge) in a network. • Degree centrality defined number of edges incident upon a node (find hubs). C D (node) = Degree of this node
 
 • Betweenness centrality indicates how much load is on a node (bottleneck). C B (node) = The average number of shortest paths that go through this node 
 • Closeness centrality defines how close a node is to all other nodes in the network. C C (node) = Inverse of the average of the shortest paths to all other nodes. https://cytoscape.github.io/cytoscape-tutorials/presentations/modules/network-analysis/index.html#/0/6
  • 45. Figure is partially adapted with modifications from original https://cytoscape.github.io/cytoscape-tutorials/presentations/modules/network-analysis/index.html#/0/6 How different centralities look HUB node that connect two sub-networks closest node to all other nodes
  • 46. Biological meaning Degree centrality Closeness centralityBetweenness centrality • Amount of control that this node has over the interactions of other nodes in the network
 • How much information load is on the node
 • Describes connectivity of the network
 • Nodes that connect two sub-networks
 • Can be calculated for edges as well • Nodes with a high degree are also called hub nodes
 • Real networks have many nodes with low degree and few nodes with high degree
 • Nodes with a high degree tend to be essential nodes
 • Regulatory elements like transcription factors often have a high out-degree • Indication for how fast information spreads from a given node to other reachable nodes in the network • The more central a node is, the smaller is the distance to all other nodes, the higher is the closeness Material is adapted from BioSB 2015 Network Analysis Course
  • 47. Brain connectivity • A few regions that link the left and the right half of our brain • They therefore have a high betweenness AS. Panditet al, Cerebral Cortex (2014) Whole-brain mapping of structural connectivity in infants reveals altered connection strength associated with growth and preterm birth
  • 48. Biological networks • Free-scale networks (tend to have power-law degree distribution) • “Small world” networks (small average path length)
 • Have hierarchical modularity property (have a high clustering coefficient independent of network size) • Robustness (have strong resistance to failure on random attacks and vulnerable to targeted attacks)
  • 50. Pattern (sub-networks) that occurs more often than in randomised networks Network motifs Different types of network show different motifs. Gene regulatory networks with transcription factors have typical regulation motifs.
  • 51. Motifs in yeast regulatory network Image is adapted from Lee et al. Transcriptional Regulatory Networks in Saccharomyces cerevisiae, Science 2002
  • 52. Motifs in yeast regulatory network • consists of a regulator that binds to the promoter region of its own gene
 • reduced response time to environmental stimuli
 • decreased cost of regulation
 • increased stability of gene expression
  • 53. Motifs in yeast regulatory network • consists of a regulatory circuit whose closure involves two or more factors 
 • provides the capacity for feedback control 
 • offers the potential to produce bistable systems that can switch between two alternative states
  • 54. Motifs in yeast regulatory network • contains a regulator that controls a second regulator and both regulators bind a common target gene
 • acts as a switch that is designed to be sensitive to sustained inputs 
 • provides control of expression of target gene depending on the accumulation of adequate levels of the master and secondary regulators
  • 55. Motifs in yeast regulatory network v • contains a single regulator that binds a set of genes under a specific condition • is responsible for some particular biological function v
  • 56. Motifs in yeast regulatory network v v • set of regulators that bind together to a set of genes • coordinates gene expression across a wide variety of biological conditions
 • two different regulators responding to two different inputs allow coordinate expression of the set of genes under two different conditions
  • 57. Motifs in yeast regulatory network v • consists of chains of three or more regulators in which one regulator binds the promoter for a second regulator and so on • simplest ordering of transcriptional events
 • regulators functioning at one stage of the cell cycle regulate the expression of factors required for entry into the next stage of the cell cycle
  • 59. Community detection Figure is adapted from original https://cytoscape.github.io/cytoscape-tutorials/presentations/advanced-automation-2017-mpi.html#/11 Identifying closely-related groups of nodes (modules/clusters) • Based on topology • Based on a shared function(s)
  • 60. Hub-based modules Module contains a node with high degree and its first neighbours
  • 61. Clique modules Module contains nodes that are all connected between each other
  • 62. MCL-based modules • Flow simulation based method • Consider a graph with many links within a cluster, and fewer links between clusters. • This means if you were to start at a node, and then randomly travel to a connected node, you’re more likely to stay within a cluster than travel between. • By doing random walks in the graph, it may be possible to discover. where the flow tends to gather, and therefore, where clusters are • Random Walks on a graph are calculated using “Markov Chains”. Image is adapted from https://micans.org/mcl/
  • 63. Betweenness-centrality based modules Algorithm step-wise removes edges (nodes) with the highest betweenness-centrality
  • 64. Quiz
  • 65. Quiz
  • 66. Quiz
  • 68. Functional enrichment Your gene
 list • Each module contains a list of genes. • You want to know the biological story behind this module.
  • 69. Functional characterisation Identify biological function of the module Cellular component Molecular function Biological process Gene Ontology KEGG Reactome Pathways Regulation miRBase miRNAs TRANSFAC TF targets Biogrid PPIs CORUM protein complexes Human Phenotype Ontology Extra
  • 71. Functional enrichment Does your gene list includes more genes with function x than expected by random chance? Genes with known
 function x ? Your gene
 list
  • 72. Tool for functional enrichment http://biit.cs.ut.ee/gprofiler J. Reimand, M. Kull, H. Peterson, J. Hansen, J. Vilo: g:Profiler - a web-based toolset for functional profiling of gene lists from large-scale experiments (2007) NAR 35 W193-W200 
 Jüri Reimand, Tambet Arak, Priit Adler, Liis Kolberg, Sulev Reisberg, Hedi Peterson, Jaak Vilo: g:Profiler -- a web server for functional interpretation of gene lists (2016 update) Nucleic Acids Research 2016; doi: 10.1093/nar/gkw199
  • 73. 2175 modules found Enrichment results for example module https://biit.cs.ut.ee/graphweb/ Example of module functional characterisation
  • 74. Clustering based on enriched function http://apps.cytoscape.org/apps/cluego
  • 75. Questions & Answers https://www.sli.do/ #P783 Ask a question Vote for a question Open browser Go to www.slido.com Enter code #P783 4 5