Dynamic programming (DP) algorithms have become indispensable in computational biology, addressing problems that range from sequence alignment and phylogenetic inference to RNA secondary structure ...

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) .

COMP_SCI 396, 496: Advanced Algorithm Design through the Lens of Competitive Programming VIEW ALL COURSE TIMES ... This course examines such topics as greedy algorithms, dynamic programming, graph ...

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.