Biological Networks Analysis - Borenstein...
Transcript of Biological Networks Analysis - Borenstein...
![Page 1: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/1.jpg)
Biological Networks Analysis
Introduction and Dijkstra’s algorithm
Genome 373
Genomic Informatics
Elhanan Borenstein
![Page 2: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/2.jpg)
The parsimony principle:
Find the tree that requires the fewest evolutionary changes!
A fundamentally different method:
Search rather than reconstruct
Parsimony algorithm
1. Construct all possible trees
2. For each site in the alignment and for each tree count the minimal number of changes required
3. Add sites to obtain the total number of changes required for each tree
4. Pick the tree with the lowest score
A quick review
![Page 3: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/3.jpg)
Small vs. large parsimony
Fitch’s algorithm:
1. Bottom-up phase: Determine the set of possible states
2. Top-down phase: Pick a state for each internal node
Searching the tree space:
Exhaustive search, branch and bound
Hill climbing with Nearest-Neighbor Interchange
Branch confidence and bootstrap support
A quick review – cont’
![Page 4: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/4.jpg)
Biological networks
What is a network?
What networks are used in biology?
Why do we need networks (and network theory)?
How do we find the shortest path between two nodes?
![Page 5: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/5.jpg)
What is a network? A map of interactions or relationships
A collection of nodes and links (edges)
![Page 6: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/6.jpg)
What is a network? A map of interactions or relationships
A collection of nodes and links (edges)
![Page 7: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/7.jpg)
The Seven Bridges of Königsberg
Published by Leonhard Euler, 1736
Considered the first paper in graph theory
Networks as Tools
Leonhard Euler 1707 –1783
![Page 8: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/8.jpg)
Types of networks Edges:
Directed/undirected
Weighted/non-weighted
Simple-edges/Hyperedges
Special topologies:
Directed Acyclic Graphs (DAG)
Trees
Bipartite networks
![Page 9: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/9.jpg)
Transcriptional regulatory networks Reflect the cell’s genetic
regulatory circuitry
Nodes: transcription factors and genes;
Edges: from TF to the genes it regulates
Directed; weighted?; “almost” bipartite
Derived through:
Chromatin IP
Microarrays
Computationally
![Page 10: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/10.jpg)
S. Cerevisiae 1062 metabolites 1149 reactions
Metabolic networks Reflect the set of biochemical reactions in a cell
Nodes: metabolites
Edges: biochemical reactions
Directed; weighted?; hyperedges?
Derived through:
Knowledge of biochemistry
Metabolic flux measurements
Homology?
![Page 11: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/11.jpg)
S. Cerevisiae 4389 proteins 14319 interactions
Protein-protein interaction (PPI) networks
Reflect the cell’s molecular interactions and signaling pathways (interactome)
Nodes: proteins
Edges: interactions(?)
Undirected
High-throughput experiments:
Protein Complex-IP (Co-IP)
Yeast two-hybrid
Computationally
![Page 12: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/12.jpg)
Other networks in biology/medicine
![Page 13: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/13.jpg)
Non-biological networks Computer related networks:
WWW; Internet backbone
Communications and IP
Social networks:
Friendship (facebook; clubs)
Citations / information flow
Co-authorships (papers)
Co-occurrence (movies; Jazz)
Transportation:
Highway systems; Airline routes
Electronic/Logic circuits
Many many more…
![Page 14: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/14.jpg)
Find the minimal number of “links” connecting node A to node B in an undirected network
How many friends between you and someone on FB (6 degrees of separation, Erdös number, Kevin Bacon number)
How far apart are two genes in an interaction network
What is the shortest (and likely) infection path
Find the shortest (cheapest) path between two nodes in a weighted directed graph
GPS; Google map
The shortest path problem
![Page 15: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/15.jpg)
Dijkstra’s Algorithm
"Computer Science is no more about computers than astronomy is about telescopes."
Edsger Wybe Dijkstra 1930 –2002
![Page 16: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/16.jpg)
Solves the single-source shortest path problem:
Find the shortest path from a single source to ALL nodes in the network
Works on both directed and undirected networks
Works on both weighted and non-weighted networks
Approach:
Iterative
Maintain shortest path to each intermediate node
Greedy algorithm
… but still guaranteed to provide optimal solution !!!
Dijkstra’s algorithm
![Page 17: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/17.jpg)
1. Initialize:
i. Assign a distance value, D, to each node. Set D to zero for start node and to infinity for all others.
ii. Mark all nodes as unvisited.
iii. Set start node as current node.
2. For each of the current node’s unvisited neighbors:
i. Calculate tentative distance, Dt, through current node.
ii. If Dt smaller than D (previously recorded distance): D Dt
iii. Mark current node as visited (note: shortest dist. found).
3. Set the unvisited node with the smallest distance as the next "current node" and continue from step 2.
4. Once all nodes are marked as visited, finish.
Dijkstra’s algorithm
![Page 18: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/18.jpg)
A simple synthetic network
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
1. Initialize: i. Assign a distance value, D, to each node.
Set D to zero for start node and to infinity for all others. ii. Mark all nodes as unvisited. iii. Set start node as current node.
2. For each of the current node’s unvisited neighbors: i. Calculate tentative distance, Dt, through current node. ii. If Dt smaller than D (previously recorded distance): D Dt iii. Mark current node as visited (note: shortest dist. found).
3. Set the unvisited node with the smallest distance as the next "current node" and continue from step 2.
4. Once all nodes are marked as visited, finish.
![Page 19: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/19.jpg)
Initialization
Mark A (start) as current node
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞
D: ∞
D: ∞
D: ∞
D: ∞ A B C D E F
0 ∞ ∞ ∞ ∞ ∞
![Page 20: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/20.jpg)
Check unvisited neighbors of A
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞
D: ∞
D: ∞
D: ∞
D: ∞ A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0+3 vs. ∞
0+9 vs. ∞
![Page 21: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/21.jpg)
Update D
Record path
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞
D: ∞
D: ∞
D: ∞,9 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
![Page 22: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/22.jpg)
Mark A as visited …
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞
D: ∞
D: ∞
D: ∞,9 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
![Page 23: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/23.jpg)
Mark C as current (unvisited node with smallest D)
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞
D: ∞
D: ∞
D: ∞,9 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
![Page 24: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/24.jpg)
Check unvisited neighbors of C
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞
D: ∞
D: ∞
D: ∞,9 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
3+2 vs. ∞
3+4 vs. 9 3+3 vs. ∞
![Page 25: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/25.jpg)
Update distance
Record path
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞
D: ∞,6
D: ∞,5
D: ∞,9,7 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
![Page 26: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/26.jpg)
Mark C as visited
Note: Distance to C is final!!
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞
D: ∞,6
D: ∞,5
D: ∞,9,7 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
![Page 27: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/27.jpg)
Mark E as current node
Check unvisited neighbors of E
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞
D: ∞,6
D: ∞,5
D: ∞,9,7 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
![Page 28: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/28.jpg)
Update D
Record path
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17
D: ∞,6
D: ∞,5
D: ∞,9,7
D: 0
A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
![Page 29: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/29.jpg)
Mark E as visited
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17
D: ∞,6
D: ∞,5
D: ∞,9,7 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
![Page 30: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/30.jpg)
Mark D as current node
Check unvisited neighbors of D
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17
D: ∞,6
D: ∞,5
D: ∞,9,7 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
![Page 31: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/31.jpg)
Update D
Record path (note: path has changed)
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17,11
D: ∞,6
D: ∞,5
D: ∞,9,7 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
7 6 11
![Page 32: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/32.jpg)
Mark D as visited
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17,11
D: ∞,6
D: ∞,5
D: ∞,9,7 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
7 6 11
![Page 33: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/33.jpg)
Mark B as current node
Check neighbors
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17,11
D: ∞,6
D: ∞,5
D: ∞,9,7 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
7 6 11
![Page 34: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/34.jpg)
No updates..
Mark B as visited
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17,11
D: ∞,6
D: ∞,5
D: ∞,9,7 A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
7 6 11
7 11
![Page 35: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/35.jpg)
A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
7 6 11
7 11
Mark F as current
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17,11
D: ∞,6
D: ∞,5
D: ∞,9,7
![Page 36: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/36.jpg)
A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
7 6 11
7 11
11
Mark F as visited
Dijkstra’s algorithm
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17,11
D: ∞,6
D: ∞,5
D: ∞,9,7
![Page 37: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/37.jpg)
A B C D E F
0 ∞ ∞ ∞ ∞ ∞
0 9 3 ∞ ∞ ∞
7 3 6 5 ∞
7 6 5 17
7 6 11
7 11
11
We now have:
Shortest path from A to each node (both length and path)
Minimum spanning tree
We are done!
B
C
A
D
E
F
9
3 1
3
4 7 9
2
2
12
5
D: 0
D: ∞,3
D: ∞,17,11
D: ∞,6
D: ∞,5
D: ∞,9,7
Will we always get a tree?
Can you prove it?
![Page 38: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/38.jpg)
Which is the most useful representation?
B
C
A
D
A B C D
A 0 0 1 0
B 0 0 0 0
C 0 1 0 0
D 0 1 1 0
Connectivity Matrix List of edges: (ordered) pairs of nodes
[ (A,C) , (C,B) , (D,B) , (D,C) ]
Object Oriented
Name:A ngr:
p1 Name:B ngr:
Name:C ngr:
p1
Name:D ngr:
p1 p2
Computational Representation of Networks
![Page 39: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/39.jpg)
![Page 40: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/40.jpg)
Networks vs. Graphs
Network theory Graph theory
Social sciences Biological sciences
Computer science
Mostly 20th century Since 18th century!!!
Modeling real-life systems
Modeling abstract systems
Measuring structure & topology
Solving “graph-related” questions
![Page 41: Biological Networks Analysis - Borenstein Labelbo.gs.washington.edu/courses/GS_373_12_sp/slides/... · 14319 interactions Protein-protein interaction (PPI) networks ... Set start](https://reader034.fdocuments.in/reader034/viewer/2022042418/5f34332475c6db2b3e1fe733/html5/thumbnails/41.jpg)
Why networks?
Networks as tools Networks as models
Diffusion models (dynamics)
Predictive models
Focus on organization (rather than on components)
Discovery (topology affects function)
Simple, visual representation of complex systems
Algorithm development
Problem representation (more common than you think)