Teaching assistant and office hours:
The following are the lecture notes to be used in the class. Note that most of these slides are provided along with the textbook by Jones and Pevzner, and can be found at this website. However, they have been updated extensively below.
A shortened introductory lecture
Updated slides on DNA mapping
Updated slides on motif finding
Updated slides on probabilistic algorithms for motif finding
Updated slides on genome rearrangement
Slides on sequence alignment and dynamic programming
Updated slides on multiple sequence alignment
Updated slides on gene prediction
Updated slides on similarity based gene prediction
Updated slides on graph algorithms for DNA sequencing
Updated slides on the reconstruction of evolutionary trees
Approximation of shortest common superstrings
In addition, material from my old slides will be added from time to time to provide coverage on more sophisticated algorithms in computational biology.
You should check the Topics of Presentation and let me know your preferences (topics and presentation time slots) as early as possible.