Description: A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a subsequence of X if there exists a strictly increasing sequence < i1, i2, ..., ik > of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
To Search:
File list (Check if you may need any files):
Common Subsequence\Common Subsequence\Common Subsequence.cpp
..................\..................\Common Subsequence.vcproj
..................\..................\Common Subsequence.vcproj.PC-20111006IXRQ.Administrator.user
..................\..................\Debug\BuildLog.htm
..................\..................\.....\Common Subsequence.exe.embed.manifest
..................\..................\.....\Common Subsequence.exe.embed.manifest.res
..................\..................\.....\Common Subsequence.exe.intermediate.manifest
..................\..................\.....\Common Subsequence.obj
..................\..................\.....\mt.dep
..................\..................\.....\vc90.idb
..................\..................\.....\vc90.pdb
..................\Common Subsequence.ncb
..................\Common Subsequence.sln
..................\Common Subsequence.suo
..................\Debug\Common Subsequence.exe
..................\.....\Common Subsequence.ilk
..................\.....\Common Subsequence.pdb
..................\Common Subsequence\Debug
..................\Common Subsequence
..................\Debug
Common Subsequence
Download