An Introduction To Sequence Comparison and Database Search

UPF, January 2010

Cedric Notredame

Send your Questions to:

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


This course is an 8 hours primer on sequence alignments. Its goal is to present an overview of the basic concepts of sequence alignments and some of their applications. The first two hours will be dedicated to molecular evolution. We will focus on the implications of molecular evolution on sequence variation. We will use these concepts to define homology. We will then see how specific mathematical models (the substitution matrices) have been derived in order to quantify the evolutionary relationship between sequences. The next two hours will be used to introduce the Needleman and Wunsch algorithm (Dynamic programming), a very basic algorithm that makes it possible to derive pairwise alignments from the sequences while using the substitution matrices. Over the following 2 hours, we will see how these pairwise alignment methods can be applied to database searches and we will develop the main concepts behind the BLAST algorithm. I will finally introduce the notion of multiple sequence alignment and show how a group of related sequences can be compared in order to infer common properties. We will then see the main principles behins two multiple sequence alignment package: ClustalW and T-Coffee.

Fri. 08/01 08:40 UPFLECTUREPairwise comparisons in an evolutionary context(1)L
Mon. 11/01 12:10 UPFLECTUREPairwise comparisons in an evolutionary context(2)L
Tue. 12/01 12:10 UPFLECTURESubstitution Matrices L
Thu. 14/01 08:40 UPFLECTUREIntroduction to Dynamic Programming [2hours]L
Mon. 18/01 09:40 UPFLECTUREDatabase Searches with BLAST(1) L
Tue. 19/01 11:10 UPFLECTUREDatabase Searches with BLAST(2) L
Wed. 20/01 08:40 UPFLECTUREMultiple Sequence Alignments (1) L
Thu. 21/01 08:40 UPFLECTUREMultiple Sequence Alignments (2)[2hours] L
Wed. 13/01 11:10 61.302-304PRACTICALGroup B: Algorithmic Problems(1) P
Thu. 14/01 13:10 61.107 PRACTICALGroup C: Algorithmic Problems(1) P
Fri. 15/01 08:40 61.302-304PRACTICALGroup A: Algorithmic Problems(1) P
Wed. 03/02 11:10 61.303PRACTICALGroup C: Introduction to Dynamic ProgrammingP
Wed. 03/02 14:10 61.307PRACTICALGroup A: Introduction to Dynamic ProgrammingP
Thu. 04/02 11:10 61.303PRACTICALGroup B: Introduction to Dynamic ProgrammingP
Wed. 05/02 08:40 (61.303)PRACTICALGroup B: Database Searches P
Wed. 05/01 11:10 (61.303)PRACTICALGroup C: Database Searches P
Thu. 08/01 09:40 (61.303)PRACTICALGroup A: Database Searches P