主題： Dynamic Programming (III).pptVIP

主題: Dynamic Programming (III);DAG shortest path problem;解題方法: DP;解題方法 (cont.);解題方法 (cont.);Example (bottom-up computation);DP 與 multi-stage graph 的關係;Critical path problem;Solution;Example: LCS;Longest increasing sequence;Recurrence: LIS;Last 陣列;計算 length(i);Example;Example (cont.);Multi-dimensional DP;例題講解 (cont.);組合藥劑的範例;Optimal substructure;Example;Recurrence;不定維度的 recursive call;不定維度的 recursive call (cont.);Multi-recurrence DP;Sequence alignment (cont.);Example;Optimal substructure;Recurrence;With gap penalty;Example;錯誤的 recurrence;Example;Multi-recurrence;Multi-recurrence (cont.);Multi-re