Summary

Dynamic programming

Statistical interpretation of alignments

Computing optimal global alignment

Computing optimal local alignment

Time and space complexity

Improvement of time and space

Scoring functions

Previous slide

Next slide

Back to first slide

View graphic version