Instructor: Krizanc

This will be a more or less traditional course on algorithms and their complexity with the proviso

that the examples will be chosen mainly for their possible application to problems in biology.

Topics may include any of pattern matching (exact/inexact),

sequence alignment (global/local/multiple), phylogenetic tree construction (distance-

based/parsimony/maximum likelihood), gene prediction, genome rearrangement, short-

est common superstring, etc. No background in either algorithms or biology will be expected.