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

The theory of dynamic programming treats problems involving multi-stage processes by means of a transformation of the problem from the space of decisions to the space of functions. This is ...

We present a dynamic programming algorithm for solving this so-called single-sink, fixed-charge, multiple-choice transportation problem exactly. The method exploits heuristics and lower bounds to ...