Description: Given a sequence X = <x1,x2,…,xm> , Another sequence Z = <z1,z2,…,zk> Is a sub-sequence of X, is the existence of a strictly increasing sequence < i1,i2,…,ik> subscript such that for all j = 1,2, ..., k so that the first j elements in Z and X in the first ij zj elements the same. Given two sequences X and Y, when another sequence Z as X, Y promoter sequence is a sub sequence, said sequence of X and Y Z is the common subsequence. Task is: given two sequences X, Y, X and Y find the longest common subsequence Z
To Search:
File list (Check if you may need any files):
1234567\1234567.cpp
.......\1234567.dsp
.......\1234567.dsw
.......\1234567.ncb
.......\1234567.opt
.......\1234567.plg
.......\Debug\1234567.exe
.......\.....\1234567.ilk
.......\.....\1234567.obj
.......\.....\1234567.pch
.......\.....\1234567.pdb
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\Debug
1234567
Download