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.

Dynamic Programming, Greedy Algorithms can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform.

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