In particular, RNA folding – a classic application of dynamic programming – utilises recurrence relations to predict the most stable secondary structures based on base-pair interactions.

In addition to a plain-vanilla implementation of dynamic programming decomposition, we consider the variants proposed by Erdelyi and Topaloglu (2011) and Zhang (2011). For the base scenario generated ...

View on Coursera Course Description This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic ...