UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 13 March 13, 2003 - Longest common substring problem - Document - PDFSEARCH.IO

First Page	Meta Content
	UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 13 March 13, 2003 Add to Reading List Document Date: 2015-01-21 19:48:42 Open Document File Size: 64,05 KB Share Result on Facebook Company Dynamic Programming / / Event Product Recall / Product Issues / / IndustryTerm words algorithm / recursive solution / / Organization UC Berkeley / / Person David Wagner Handout / / Product 1 Introduction / / Technology words algorithm / / SocialTag Control theory Longest common subsequence problem Algorithm Substring Longest common substring problem Fibonacci number Overlapping subproblems Longest increasing subsequence Dynamic programming Mathematics

UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 13 March 13, 2003Add to Reading List