Algorithms for Molecular Biology, Autumn 2004

A CUGS PhD course arranged by Andrzej Lingas.


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. The purpose of the course is to give in-depth insight in the construction and analysis of algorithms for (primarily, molecular) biological applications.

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

The course gives 5 points. In order to pass it, students are required to return acceptable solutions for a sufficient number of homework problems and present a relevant paper. The participants are expected to have basic knowledge in algorithms (e.g., corresponding to DAT107, DAT119 or DAT302).

The course is given on September 23, 24 in the lecture room E:D, and October 21, 22 in the lecture room E:1406 in the E building of LTH, Ole Romers väg 3.


Schedule:


Last edited September 20, 2004 by Andrzej Lingas

Valid HTML 4.01!