Week long residential course.

New computational challenges arise from biological data and more effective and efficient algorithms are urgently needed to tackle them.

If you are unable to attend the current course dates and you would like to be informed about future courses please click here to leave your details.

The lead tutor for this course is Professor Peter Jeavons, from the Computing Laboratory at the University of Oxford.

Course dates

The date for this course will be announced shortly. In the mean time please contact the programme office for further information.

Contents

• The Algorithm Design Process
• Problems -> Specifications -> Algorithms
• Efficiency: time and space complexity, Big O notation
• Searching in Sequences/ Comparing Sequences/ Molecular structure
• Boyer-Moore and Knuth-Morris-Pratt algorithms, Heuristics: Blast and Fasta
• Dynamic Programming, Statistical Alignment, Hidden-Markov-Models
• Multiple sequence alignment
• Secondary structure prediction, determining structure, Predicting structure
• Feasibility
• Appropriate technology, Moore's Law
• NP Problems, NP-completeness, examples

Requirements

There are no pre-requisites for this course but students are advised to be familiar with the basic concepts of computer science and programming. Students should know what an algorithm is and have some experience of writing actions in an algorithmic form. The Perl Programming for Bioinformatics module is also suitable preparation.