What is dynamic programming?

@article{Eddy2004WhatID,
  title={What is dynamic programming?},
  author={Sean R. Eddy},
  journal={Nature Biotechnology},
  year={2004},
  volume={22},
  pages={909-910}
}
  • S. Eddy
  • Published 2004
  • Medicine, Computer Science
  • Nature Biotechnology
Sequence alignment methods often use something called a 'dynamic programming' algorithm. What is dynamic programming and how does it work? 

Paper Mentions

Algorithms, analysis and software for the global optimization of two-stage stochastic programs
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Chemical Engineering, 2018.
A DYNAMIC PROGRAMMING SOLUTION OF THE JEEP PROBLEM
The jeep problem is solved by dynamic programming.
Recursion Schemes for Dynamic Programming
TLDR
A new recursion combinator, dynamorphism, is presented, which captures the dynamic programming recursion pattern with memoization and identifies some simple conditions when functions defined by structured general recursion can be redefined as a dynamorphisms. Expand
A Mathematical Optimization Problem in Bioinformatics
Abstract This article describes the sequence alignment problem in bioinformatics. Through examples, we formulate sequence alignment as an optimization problem and show how to compute the optimalExpand
Abstract Dynamic Programming
Dynamic Programming Dimitri P. Bertsekas Massachusetts Institute of Technology WWW site for book information and orders http://www.athenasc.com Athena Scientific, Belmont, Massachusetts
A dynamic programming approach to achieving an optimal end-state along a serial production line
This publication contains reprint articles for which IEEE does not hold copyright. Full text is not available on IEEE Xplore for these articles.
A Logic-based Approach to Dynamic Programming
We present a first-order value iteration algorithm that addresses the scalability problem of classical dynamic programming techniques bylogically partitioning the state space. An MDP is representedExpand
An improving dynamic programming algorithm to solve the shortest path problem with time windows
TLDR
An efficient way of reducing the number of labels saved and dominance computing time is proposed and validated by experiments on shortest path problem with time windows instances. Expand
Practical Protein Sequence Alignment With Algebraic Dynamic Programming
TLDR
This work examines several heuristic techniques for filtering unlikely candidates and locating specific sites for local alignment, and discusses plans for developing domain specific languages for alignment problems, which use heuristics to restrict the range of alignment. Expand
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
Eye of the hurricane : an autobiography
This is a very frank and detailed account by a leading and very active mathematician of the past decades whose contributions have had an important impact in those fields where mathematics is now anExpand
Traveling Salesman Problem Sariel (UIUC) New CS473 81 Fall
  • Traveling Salesman Problem Sariel (UIUC) New CS473 81 Fall
  • 1981
The complexity of this algorithm is O(N 2 ), where N = S.length
  • The complexity of this algorithm is O(N 2 ), where N = S.length
Traveling Salesman Problem Problem (TSP) Input: A graph G = (V, E) with non-negative edge costs/lengths
  • Traveling Salesman Problem Problem (TSP) Input: A graph G = (V, E) with non-negative edge costs/lengths