Computational Biology, Winter 2008

An International Master's course arranged by Andrzej Lingas

Course plan

Lectures

Several basic algorithmic problems occurring in molecular biology are considered: e.g., string and sequence problem, protein folding, construction of evolutionary trees etc. The final lecture is devoted to DNA computing.

Goals

The purpose of the course is to give in-depth insight in the construction and analysis of algorithms for (primarily, molecular) biological applications.

Recommended for

The course is recommended for students having interest in algorithms/complexity theory or/and bioinformatics.

Examination

In order to pass the course, students are required to return acceptable solutions for a sufficient number of homework problems and present a relevant paper.

Prerequisites

Basic courses in algorithms and data structures, and discrete mathematics (e.g., corresponding to DAT107, DAT119 or DAT302).

Contents

The tentative plan of the course is as follows:

Preliminary results

For G at least 450, for VG at least 650.


Last edited March 19, 2008 by Andrzej Lingas

Valid HTML 4.01!