Revision as of 05:46, 16 February 2015 view source CNHume (talk \| contribs) 159 edits m →‎{{header\|C++}} ← Older edit		Revision as of 06:04, 16 February 2015 view source CNHume (talk \| contribs) 159 edits m →‎{{header\|C++}} Newer edit →
Line 328: =={{header\|C++}}== '''The Longest Common Subsequence (LCS) Problem''' Defining a subsequence to be a string obtained by deleting zero or more symbols from an input string, the LCS Problem is to find a subsequence of maximum length that is common to two input strings.

Longest common subsequence: Difference between revisions