Difference between revisions of "Longest common subsequence"
From PEGWiki
(Created page with "The '''longest common subsequence''' problem is the problem of finding a sequence of maximal length that is a subsequence of two input sequences. Formally, given two sequence...") |
(No difference)
|
Revision as of 07:06, 16 November 2010
The longest common subsequence problem is the problem of finding a sequence of maximal length that is a subsequence of two input sequences. Formally, given two sequences ![[x_1, x_2, ..., x_m]](/wiki/images/math/f/4/a/f4a7a5ff5d2a681406a93bc575871f34.png)
and ![[y_1, y_2, ..., y_n]](/wiki/images/math/9/7/d/97d463a129d6fd8ebe111b62a2032d0e.png)
.
