Algorithm for Sequence Analysis in Bioinformatics
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. 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.
|1||ASAB||LECTURE||Pairwise comparisons in an evolutionary context||L|
|3||ASAB||LECTURE||Introduction to Dynamic Programming-1||L|
|4||ASAB||LECTURE||Introduction to Dynamic Programming-2||L|
|6||ASAB||LECTURE||Introduction to Multiple Sequence Alignment||L|
|7||ASAB||LECTURE||Multiple Sequence Alignment Algorithms||L|
|8||ASAB||LECTURE||RNA Folding Algorithms||L|
|1||ASAB||PRACTICALS||Parsing Biological Files||P|
|2||ASAB||PRACTICALS||Computing Substitution Matrices||P|
|3||ASAB||PRACTICALS||Introduction to Dynamic Programming 1||P|
|4||ASAB||PRACTICALS||Introduction to Dynamic Programming 2||P|
|5||ASAB||PRACTICALS||Parsing and manipulating binary trees||P|
|6||ASAB||PRACTICALS||Implementing your own multiple sequence aligner||P|
This Entire Course Was Automatically Generated Using BED, the Bioinformatics Exercise Database. BED is a freeware available on request Cedric Notredame