Online Lectures on Bioinformatics
Algorithms for SP-optimal multiple alignments
This section was kindly provided by
Jens Stoye
.
Overview:
Definition
Motivation
Score functions
The problem
The exact solution
Saving space
Affine gap-costs
Reduction of search space
Divide-and-Conquer Alignment
References
Comments are very welcome.
luz@molgen.mpg.de