An Introduction To Sequence Comparison and Database Search
An intermediate level course on algorithms in bioinformatics. We will use it to explain common concepts in sequence analysis, starting from the biological relevance of sequence alignment and making our way through the most commonly used algorithms, including Needleman and Wunsch, Smith and Waterman for pairwise alignments, BLAST for database searches, Nussinov for RNA folding and the progressive multiple alignment. We will aslo provide an introduction to Hidden Markov Modelling through the occasionally dishonest casino exemple. The practicals will be in Python and will involve driving the students through an implementation of these algorithms. The biobliography is given by order of importance.
Practicals will be in python 2.7. They will involve adapting existing scripts rather than programming from scratch. For this reason, students with no practical knowledge of python but with a good grasp of programming languages like Perl, C or JAVA should manage reasonnably well. Students are expected to bring their own lap-top and advised to have a LINUX boot though Virtual MAchine support will be provided.
Using the information and the code provided in the practical 4.1 assemble a multiple sequence aligner. Report on this task and on the combination of the various algorithmic components. Report on the stability of this aligner, especially with respect to the sequence input order. Note: you can use the tcoffee package to compare your alignment with the option
|1.1||BU||LECTURE||Pairwise comparisons in an evolutionary context||L|
|1.2||BU||LECTURE||Introduction to Dynamic Programming||L|
|1.1||BU||PRACTICALS||Parsing Biological Files||P|
|1.2||BU||PRACTICALS||Computing Substitution Matrices||P|
|2.1||BU||LECTURE||Introduction to Dynamic Programming||L|
|2.2||BU||LECTURE||RNA Folding Predictions||L|
|2.1||BU||PRACTICALS||Introduction to Dynamic Programming||P|
|2.2||BU||PRACTICALS||Introduction to Dynamic Programming||P|
|4.2||BU||LECTURE||HMM Introduction I||L|
|4.1||BU||PRACTICALS||Implementing an MSA Algorithm||P|
|5.1||BU||LECTURE||HMM Introduction II||L|
This Entire Course Was Automatically Generated Using BED, the Bioinformatics Exercise Database. BED is a freeware available on request Cedric Notredame