Sequence alignment methods often use something called a 'dynamic programming' algorithm. What is dynamic programming and how does it work?

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

We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of pre-selected basis functions to the dynamic ...

This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for computational geometry. We will discuss how to use these techniques ...

CSCA 5414: Dynamic Programming, Greedy Algorithms CSCA 5414: Dynamic Programming, Greedy Algorithms Get a head start on program admission Preview this course in the non-credit experience today! Start ...

Participants tackled seven problems covering complex topics including dynamic programming, graph theory, and real-world data structures.