demo LCS longest_common subsequence

problem : given two strings x and y, find the longest common subsequence (LCS) and print its length % Example: % x: abcic

% code_m

% problem : given two strings x and y, find the longest common

% subsequence (LCS) and print its length

% Example:

% x: abcicba

% y: abdkscab

% "abca" is the longest subsequence found in both sequences, so the

% answer is 4

%{

How to slove this problem?

This demo is show how to find LCS using dynamic programming algorithem.

D(i,j):

if x(i -1) == y(i - 1)

D(i - 1, j - 1)

else

max(D(i - 1, j), D(i, j - 1))

Then do trace back

%}