Lectures and Quizzes
- (Jan 15) Introduction
(PPT)
(PDF)
- (Jan 17) Algorithms and problems
(PPT)
(PDF)
- (Jan 22) Induction and recurrences
(PPT) (PDF)
- (Jan 24) Running times and Big-Oh notation
(PPT) (PDF)
- (Jan 29) Simple techniques for Big-Oh analysis
(PPT) (PDF)
- (Jan 31) Introduction to combinatorial counting
(PPT) (PDF)
- (Feb 5) Review of the material so far.
- (Feb 7) First quiz.
- (Feb 12) Solutions to the first quiz. Then
an overview
about NP-completeness and heuristics for
NP-hard optimization problems.
- (Feb 14-19) More on NP-hardness,
approximation algorithms, and
heuristics (PDF)
(PPT)
- (Feb 21) Second quiz.
- (Feb 26) Review of running time analyses and
dynamic programming
(PPT).
- (Feb 28) Dynamic programming solution to pairwise multiple
alignment
(PPT).
- (Mar 4) Review of material (preparation for quiz 3).
- (Mar 6) Quiz 3.
- (Mar 18-Apr 3) Phylogenetic estimation
(PPT)
(PDF).
Fourth quiz given on April 3.
- (Apr 8-10) Sequence assembly
(PPT)
- (Apr 15-17) Review of course
- (April 22)
Yousif Seedham,
Sarah Brubaker,
Paul Casey
- (April 24) Student presentations
(1) Steven Wine and Vlad Furash
(PPT),
(2) KT Hughes, (3) Ian McCoy
(PPT),
and
(4) Mussie Araya
(PPT).
-
(April 29)
(1) Shane Wood (PPT)
(2) Chase Jahn (PPT),
(3) Teresa Ojode (PPT), and
(4) Zachary Kinnaird (PPT).
- (May 1)
Preparation for final exam (or more student
presentations, if we aren't done)
Homeworks
- Homework #1, due
January 31, 2008, in class.
Solutions to this homework are
available here.
- Homework #2:
write out complete solution to
the first quiz (including
the extra credit);
due Feb 14.
-
Homework #3, assigned on Feb 14, due Feb 21.
- Homework #4, assigned on Feb 21, due Feb 28.
-
Homework #5,
assigned on Feb 28, due March 4.
- Sixth homework assigned on March 18, due March 20.
-
Homework #7, assigned on March 20, due March 27.