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

IEMS 469: Dynamic Programming VIEW ALL COURSE TIMES AND SESSIONS Prerequisites Basic knowledge of probability (random variables, expectation, conditional probability), optimization (gradient), ...

This paper develops a formalism within which the application of dynamic programming to discrete, deterministic problems is rigorously studied. The two central concepts underlying this development are ...

A two-dimensional dynamic programming problem is posed. By relaxing some of the restraints on the problem it is reduced to a standard dynamic programming problem. Results are quoted from a particular ...