Dynamic programming is a mathematical way of looking at a problem by considering the problem in reverse order. The word programming in the term does not refer to writing computer programs. Rather, dynamic programming is a mathematical term to describe a set of rules used to solve a problem. These rules do not necessarily have to be written in a computer language

Computerized dynamic programming is, nonetheless, a powerful problem-solving tool. It has found a useful niche in the biological sciences as a means of deciphering order in biological systems.

Dynamic programming was first described over forty years ago by the American mathematician Richard Bellman. In the years since its inception, dynamic programming has been applied to problems ranging from the analysis of biological systems to the game of darts.

In biological computing, also called bioinformatics, dynamic programming has been a powerful technique. Genomic analysis probably...