2008 Paper 9 Question 1 Bioinformatics (a) A long DNA sequence is used as a training set for parameter estimation of the DNA statistical model. The […]
2007 Paper 8 Question 13 Bioinformatics (a) Describe with one example the difference between Hamming and Edit distances. [2 marks] (b) Discuss the Smith–Waterman algorithm. What […]
2007 Paper 9 Question 13 Bioinformatics (a) Describe a bioinformatics application of hidden Markov models. [6 marks] (b) Discuss the properties of the Markov clustering algorithm […]
2006 Paper 8 Question 13 Bioinformatics (a) Why do we use dynamic programming algorithms for pairwise sequence alignment problems but not for multiple pairwise alignment? [5 […]