Dynamic Programing
Dynamic Programing
Dynamic Programing
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Property of DP problems<br />
• Have overlapping subproblems<br />
• Have optimal solutions to subproblems<br />
• Can be represented in recurrence relation<br />
• Are context-independent<br />
e.g. In sequence alignment, quantifying similarity is only based on pairs of residues.<br />
Similarity is independent of environment of residues we align.