Describe the differences between Soft and Hard Clustering
Explain with one example the difference between local and global alignment
March 21, 2023For problems involving hidden Markov models (HMM), when would you use the Baum-Welsh algorithm and when the Viterbi algorithm and why?
March 21, 2023Describe the differences between Soft and Hard Clustering
COMPUTER SCIENCE TRIPOS Part II – 2017 – Paper 7
Bioinformatics (PL)
(a) Discuss the time and space complexity of dynamic programming algorithms in
the context of sequence alignment problems. [6 marks]
(b) Describe the differences between Soft and Hard Clustering. [6 marks]
(c) Construct the de Bruijn graph of TACCTTCAGCGCCTTC by splitting it into k-mers
for a suitable value of k. Comment on how the choice of k affects the
construction. Discuss the use of de Bruijn graphs in the context of genome
sequencing. [8 marks]
