An Introduction To Sequence Comparison and Database Search |
This course is an 4 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. |
| Date | Location | Session | Title | Links | |
| 1.1 | UAB | LECTURES | Pairwise comparisons in an evolutionary context - Introduction | Slides Voiceover | |
| 1.2 | UAB | LECTURES | Pairwise comparisons in an evolutionary context - 1 | Slides Voiceover | |
| 1.3 | UAB | LECTURES | Pairwise comparisons in an evolutionary context - 2 | Slides Voiceover | |
| 2.1 | UAB | LECTURES | Substitution Matrices | Slides Voiceover | |
| 2.2 | UAB | LECTURES | Comparing Sequences | Slides Voiceover | |
| 2.3 | UAB | LECTURES | Introduction to Dynamic Programming -1 | Slides Voiceover | |
| 2.4 | UAB | LECTURES | Introduction to Dynamic Programming -2 | Slides Voiceover | |
| 3 | UAB | PRACTICALS | Dynamic Programming (Perl) | P | |
| 3 | UAB | PRACTICALS | Dynamic Programming (Python) | P Voiceover | |
| . | |||||
This website was automatically generated using BED, the Bioinformatics Exercise Database. BED is a freeware available on request Cedric Notredame |