(algorithmic technique)
Definition: Solve an optimization problem by caching subproblem solutions (memoization) rather than recomputing them.
Aggregate parent (I am a part of or used in ...)
Smith-Waterman algorithm.
See also greedy algorithm, principle of optimality. Solves these problems: matrix-chain multiplication problem, longest common substring, longest common subsequence.
Note: From Algorithms and Theory of Computation Handbook, page 1-26, Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.
Author: CRC-A
Dan Hirschberg's example of using dynamic programming for matrix multiplication and longest common substring and subsequence, including pseudocode.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Tue Jan 11 15:50:21 2005.
HTML page formatted Wed Oct 26 09:47:28 2005.
Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "dynamic programming", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/dynamicprog.html
