Spring 2008
Professor: Natasa
Przulj (natasha@ics.uci.edu)
TA: Ajeet Kumar (kumara@ics.uci.edu)
Office Hours: Thursdays
5-6pm, ICS-1 building, Room 406B
Ø Week 1:
o
Introduction: graphs and their representations; algorithm analysis.
Ø Week 2:
o Depth-first
search and its applications.
o
Homework 1 given out (in Thursday class).
Ø Week 3:
o Directed
Graphs, breadth-first search, shortest paths algorithms.
o
Homework 1 due (at the beginning of Thursday class).
Ø Week 4:
o More shortest paths algorithms.
o
Homework
1 graded and returned (in Tuesday class).
o
Homework 2 given out (in Thursday class).
Ø Week 5:
o Minimum
Spanning Trees (MST).
o
Homework 2 due (at the beginning of Thursday class).
Ø Week 6:
o Minimum
Spanning Trees (MST) continued.
o
Homework
2 graded and returned (in Tuesday class).
o Midterm I (in Thursday
class).
o
Homework 3 given out (in Thursday class).
Ø Week 7:
o
Homework 3 due (at the beginning of Thursday class).
Ø Week 8:
o Network
flow and matching continued.
Introduction to biological networks.
o
Homework
3 graded and returned (in Tuesday class).
o Homework 4
given out (in Thursday class).
Ø Week 9:
o Paradigms
for biological network analyses: network models, properties, clustering, data
sets, tools.
o Homework 4 due
(at the beginning of Thursday class).
Ø Week 10:
o Biological
networks continued.
o Homework 4 graded
and returned (in Tuesday class).
o Midterm II (in Thursday
class).
Natasa Przulj
Page last updated on April 7,
2008.