COMPUTER SCIENCE TRIPOS Part II – 2016 – Paper 9 Bioinformatics (PL) (a) Explain the steps and the complexity of the Hirschberg algorithm and illustrate them […]
COMPUTER SCIENCE TRIPOS Part II – 2016 – Paper 7 Bioinformatics (PL) (a) Explain the uses of Eulerian and Hamiltonian graphs in the context of genome […]
COMPUTER SCIENCE TRIPOS Part II – 2017 – Paper 9 Bioinformatics (PL) (a) For problems involving hidden Markov models (HMM), when would you use the Baum-Welsh […]
COMPUTER SCIENCE TRIPOS Part II – 2017 – Paper 7 Bioinformatics (PL) (a) Discuss the time and space complexity of dynamic programming algorithms in the context […]