46
Introduction to Bioinformatics Biological Networks Department of Computing Imperial College London Spring 2010 Nataša Pržulj [email protected]
Introduction to Bioinformatics
Biological Networks
Department of ComputingImperial College London
Spring 2010
Nataša Prž[email protected]
2
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
- Pseudocode (Chpt 1.1)- Growth Rate of Running Time
by Goodrich and Tamassia
Graph Algorithms Review Continued
4
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
However: beware of large constants!
1212
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
Applications of DFS:(DFS is O(|V| + |E|), i.e., linear time)• path finding• cycle finding• topological sort (ordering of vertices of G such that uv is in E implies that u appears before v in the ordering)• Strongly Connected Components (SCCs) of a digraph• A digraph is strongly connected if every vertex is reachable from every other vertex following the directions of the arcs (edges)
13
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(follows from definitions)
1414
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
In digraphs searches must follow the directions of edges.
1717
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 142)
2020
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
2222
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 142, 202)
2929
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 142)
30
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 142)
3131
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 142)
3232
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 142)
3333
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 142)
3434
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
3535
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
36
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
3737
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
3838
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
3939
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
4040
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
4141
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
4242
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
43
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
44
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
45
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
46
Assumed Knowledge of Graph Theory and Algorithms:
Nataša Prž[email protected]
(Review: Computing 202)
