6.006 | Spring 2008 | Undergraduate

Introduction to Algorithms

Lecture Notes

Lecture 20: Dynamic Programming II: Longest Common Subsequence, Parent Pointers

Description:

Lecture notes on dynamic programming, longest common subsequence, bottom-up implementation, and parent pointers for guesses.

Resource Type:
Lecture Notes
pdf
519 kB
Lecture 20: Dynamic Programming II: Longest Common Subsequence, Parent Pointers
Learning Resource Types
Problem Sets
Exams with Solutions
Lecture Notes
Presentation Assignments with Examples