Study Corner

1. Computational Genomics

This course will explore computational techniques for processing and analyzing large-scale biological sequence coming from the genomics revolution. We will study string search and comparison algorithms, data structures for efficiently storing and querying strings, and techniques such as Hidden Markov Models for finding patterns within long strings. The emphasis will be on the underlying algorithms, rather than on the use of particular tools or databases (though examples of widely used tool will be presented).

Instructor:  Carl Kingsford

2. MIT Open Course: Introduction to Algorithm

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

3. String Algorithms and Algrorithms in Computational Biology - Gusfield

The class will be a mixture of three major topic areas: 1) string algorithms, particularly based on suffix arrays and trees 2) algorithms and combinatorial structure for phylogenetic networks (for this topic we will refer to the recent book ``Phylogenetic Networks" by Huson et al. 3) algorithms to deduce phylogenetic networks involving recombination as well as mutation..

4. Introduction to Information Retrieval

The book aims to provide a modern approach to information retrieval from a computer science perspective.

---