Standard Article

Dynamic Programming

  1. Ting Chen,
  2. Michael Waterman

Published Online: 23 SEP 2005

DOI: 10.1038/npg.els.0005254



How to Cite

Chen, T. and Waterman, M. 2005. Dynamic Programming. eLS. .

Author Information

  1. University of Southern California, Los Angeles, California, USA

Publication History

  1. Published Online: 23 SEP 2005


Dynamic programming is an optimization technique used in mathematics and computer science. It solves problems by recursively solving the subproblems that have overlapping substructures and then combining the solutions to these subproblems.


  • optimization algorithm;
  • sequence alignment;
  • RNA secondary structure;
  • gene-finding;
  • hidden Markov model