Dynamic programming algorithms are a good place to start understanding what's really going on inside computational biology software. The heart of many well-known programs is a dynamic programming ...

Finite horizon sequential decision problems with a "temporal von Neumann-Morgenstern utility" criterion are analyzed. This criterion, as developed in [7], is a generalization of von ...