文件名称：shortest common sequence
文件大小：5KB
文件格式：RAR
更新时间：2012-10-29 02:58:51
shortest common sequence,scs
This shortest common supersequence problem is closely related to the longest common subsequence problem. Given two sequences X = < x1,...,xm > and Y = < y1,...,yn >, a sequence U = < u1,...,uk > is a common supersequence of X and Y if U is a supersequence of both X and Y.
【文件预览】：
SCS
----.project(379B)
----bin()
--------scs()
----src()
--------scs()
----data2.dat(32B)
----.classpath(232B)
----result2.dat(22B)