Algorithms in Bioinformatics

5, February 2001

Lecturer: Tomi Pasanen

 

 

1.   Formulate the two way of doing sequence assembly.

2.   How to reduce the volume in multiple sequence alignment?

3.   What are structures of hairpin and how the minimum free-energy hairpin can be computed? How much running time is required? How we can reduce the computation time for hairpins?

4.   a) What are trees and splits and how they are related? How to construct a tree from a set of splits, and how to construct a set of splits for a tree?
b)When a split set defines a tree?
c) Metrics on trees and how they can be calculated.