2009 Paper 9 Question 3 Bioinformatics (a) Compute the global alignment between the two strings s1 = ACCGTT and s2 = AGTTCA, considering the following scoring […]
2009 Paper 7 Question 5 Bioinformatics (a) Discuss, with one example, the complexity of the Nussinov algorithm for RNA folding. [5 marks] (b) In the context […]
2010 Paper 9 Question 3 Bioinformatics (a) Discuss why the use of spaced seeds in sequence database search is better than the use of consecutive seeds. […]
2010 Paper 7 Question 5 Bioinformatics (a) Discuss the space–time complexity of dynamic programming algorithms in sequence alignment. [7 marks] (b) Discuss with one example how […]