Online Lectures on Bioinformatics
Algorithms for the comparison of two sequences
This section provides the reader with a formal notation of the algorithms to compare two sequences, which are based on dynamic programming. Furthermore gap-functions, score- and distance-functions are discussed in detail.
Overview:
- Introduction: Type I and type II alignments
- Type I alignment
- Type II alignment
- General gap functions for type II alignments
- Minimum distance alignments
- Minimum distance alignment score as a metric on sequences
- References
Comments are very welcome.
luz@molgen.mpg.de