文件名称：LCS和CLCS的java实现
文件大小：200KB
文件格式：ZIP
更新时间：2013-07-07 20:18:34
LCS CLCS 线性空间 DP 分治
1. LCS in linear space. A program to compute longest common subsequence between two sequences but in linear space. 2. Constrained LCS. Given two sequences X, Y and a constrained sequence P, a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest subsequence of X and Y such that P is a subsequence of Z. 1. For LCS in linear space. The output is not only the length of subsequence, but also the exact elements of the subsequence. Both dynamic programming and divided-and-conquer methods are required so that it is in linear space. 2. For constrained LCS. One is required to give and implement a dynamic programming for this problem. The analysis of the dynamic programming should include in the report.
【文件预览】：
homework-algorithm.xml
homework-algorithm.jar
Homework-Algorithm
----bin()
--------com()
----.settings()
--------org.eclipse.jdt.core.prefs(617B)
----src()
--------com()
----.project(377B)
----.classpath(379B)
----.myeclipse()
--------profiler()