Related:
[!quote] Dynamic Programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions using a memory-based data structure (array, map, etc.). So the next time the same sub-problem occurs, instead of recomputing its solution, one simply looks up the previously computed solution, thereby saving computation time. 1
dynamic programming is a method, not limited to specific coding languages
a bioinfo example is the [[./Needleman Wunsch algorithm|Needleman Wunsch algorithm]] when it comes to [[../../../sequence alignment|sequence alignment]]