An Introduction to Pairwise and Multiple Sequence Alignments Sequence Alignments

Madrid, November 2008

Cedric Notredame




Send your Questions to: cedric.notredame@crg.es



This Entire Course Was Automatically Generated Using BED, the Bioinformatics Exercise Database. BED is a freeware available from Cedric Notredame



OBJECTIVES

This course is dedicated to sequence alignments, pairwise and multiple. We will start by introducing the alignment problem in an evolutionary context, explaining what the biological issues are and what are the models that have been designed to compare sequences in a biologically meaningful way. We will then look in details at the most common dynamic programming algorithm: Needleman and Wunsch. The second part of the course will be dedicated to multiple sequence alignments. We will introduce the context in which such a modeling is useful and will then develop the most common algorithms. All along the course we will insist on the main limitations of the available approaches.



DateLocationSessionTitleLinks
Wed. 12/11 LECTUREPairwise Sequence Alignments: an Evolutionary PerspectiveL
Wed. 12/11 LECTURE Pairwise Sequence Alignments: an Algorithmic PerspectiveL
Thu. 13/11 LECTUREIntroduction to multiple sequence alignments in BiologyL