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.
| Week No. | Date | Topics | Remark |
| 1 | 14 Aug 2009 | Basics of Molecular Biology | |
| 2 | 21 Aug 2009 | Sequence comparison | |
| 3 | 28 Aug 2009 | Multiple Sequence Alignment | |
| 4 | 4 Sept 2009 | Suffix tree (1) | |
| 5 | 11 Sept 2009 | Suffix tree (2) | |
| 6 | 18 Sept 2009 | Database searching | |
| 25 Sept 2009 | Recess week | ||
| 7 | 2 Oct 2009 | Midterm | |
| 8 | 9 Oct 2009 | Motif finding (1) | |
| 9 | 16 Oct 2009 | Motif finding (2) | |
| 10 | 23 Oct 2009 | Motif finding (3) | |
| 11 | 30 Oct 2009 | RNA secondary structure prediction | |
| 12 | 6 Nov 2009 | RNA secondary structure comparison | |
| 13 | 13 Nov 2009 | Project Presentation | |
| Nov 2009 | Reading period | ||
| Nov 2009 | Examination |