Click here to visit the IVLE course webpage (that is the main page).
Biology data are too enormous. Handling them using brute-force approaches becomes impossible and efficient algorithms are required. This module has an in-depth study of some of these advance algorithms. Through the course, students not only are able to understand these algorithms in detail, but are also given chances to solve some research problems in this field.
Prerequisites: Pass CS3230 (Design and Analysis of Algorithms) or its equivalence. Note that students are expected to have good understanding in the analysis of algorithm (e.g. Recursion, Dynamic Programming, time complexity analysis, etc). From the past experience, students without good knowledge in algorithm cannot catch up with the pace of the module.
|1||16 Aug 2012||Basics of Molecular Biology|
|2||23 Aug 2012||Suffix Tree (1)|
|3||30 Aug 2012||No class|
|4||6 Sept 2012||Suffix tree (2)|
|5||13 Sept 2012||Genome Assembly (1)|
|6||20 Sept 2012||Genome Assembly (2)|
|27 Sept 2012||Short Tag mapping Recess week|
|7||4 Oct 2012||Structural variation + Midterm|
|8||11 Oct 2012||ChIP-seq analysis|
|9||18 Oct 2012||Motif finding (1)|
|10||25 Oct 2012||Motif finding (2)|
|11||1 Nov 2012||RNA secondary structure prediction|
|12||8 Nov 2012||RNA secondary structure comparison|
|13||15 Nov 2012||Project Presentation|
|22 Nov 2012||Reading period|
|4 Dec 2012||Examination|