×
+ All Categories
Log in
English
Français
Español
Deutsch
The top documents tagged [lcs problem]
Home >
lcs problem
Dynamic Programming
172 views
Longest Common Subsequence Definition: The longest common subsequence or LCS of two strings S1 and S2 is the longest subsequence common between two strings.
228 views
Review: Dynamic Programming Dynamic programming is another strategy for designing algorithms Use when problem breaks down into recurring small subproblems.
216 views
Simple and fast linear space computation of Longest common subsequences Claus Rick, 1999.
226 views
CSC 413/513: Intro to Algorithms Greedy Algorithms.
259 views