Algorithm Design and Complexity course 7-11 July 2008

Algorithm Design and Complexity Course

7-11 July 2008, Oxford

http://bioinfomsc.stats.ox.ac.uk/subjects/ADC.html

Oxford Bioinformatics Programme, Oxford University

Professor Peter Jeavons, from the Computing Laboratory at the University of=
 Oxford, leads this course addressing the new computational challenges whic=
h arise from biological data and the more effective and efficient algorithm=
s which are urgently needed to tackle them.

This course covers:
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 =


The standard cost of the course is =A31350.  There is a substantial discoun=
t available to members of academic institutions and the NHS, which reduces =
the cost to =A3945.

To book, or for more information, contact [email protected] or visit our=
 website: http://bioinfomsc.stats.ox.ac.uk/subjects/ADC.html

 =