Algorithms for Molecular Biology2006HT
Several basic algorithmic biological problems will be considered:
e.g., string and sequence problem, fragment assembly, protein
folding, construction of evolutionary trees etc. The final lecture
will be devoted to DNA computing.
students having interest in algorithms/complexity theory
The course was last given
A similar course for CUGS was given at university in the fall of 2004.
The purpose of the course is to give in-depth insight in the
construction and analysis of algorithms and data structures for
(primarily, molecular) biological applications.
Several biological problems which require algorithmic solutions are considered, e.g., various string and sequence problems, protein folding, construction of evolutionary trees etc. Even molecular computing, databases and internet resources accessible within molecular biology are discussed.
Basic courses in algorithms and data structures, and discrete
The tentative plan of the course is as follows.
2. Sequence alignment and multiple-alignment
3. Fragment assembly
4. Physical mapping
6. Phylogenetic trees
7. Protein folding
8. Sorting by reversals
9. DNA computing
10. Algorithmic problems in drug design
The lectures and possible student presentations would be given
in two, two-day series at the department of Computer Science
at Lund university (September/October?)
The course is based on fragments of several textbooks (especially that
by Setubal and Meidanis on molecular computational biology) and
Prof. Andrzej Lingas, Eva-Marta Lundell, Mia Persson,
dr. Krzysztof Pawlowski (Astra-Zeneca)
Prof. Andrzej Lingas, Lund University
The examination will be based on evaluation of homework assignments
and student paper presentations
Lund university (CUGS)
Page responsible: Director of Graduate Studies
Last updated: 2012-05-03