Online Lectures on Bioinformatics

Algorithms for SPoptimal multiple alignmentsThe problem
Given the sequences
s^{(1)}, s^{(2)},...,s^{(n)}.
Find an optimal alignment A^{opt} which maximizes
:
is the optimal alignmentscore. Note that there may be several optimal alignments for a set of sequences, while, of course, the optimal alignment score is unique.
Comments are very welcome. luz@molgen.mpg.de 