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.

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Daniel R. Jiang, Warren B. Powell, An Approximate Dynamic Programming Algorithm for Monotone Value Functions, Operations Research, Vol. 63, No. 6 (November-December 2015), pp. 1489-1511 ...