搜索资源列表
-
0下载：
参考算法导论写的LCS算法，仿照STL的泛型风格，适用于多种STL容器中的各种类型数据构成的序列的最大公共子序列（Longest Common Subsequence）问题求解。-reference Introduction to write the algorithm LCS algorithm, modeled on the STL Generic style. STL is applicable to many types of containers data constitute the
-
-
0下载：
求X和Y两个字符串的最长公共子序列。（X和Y字符串分别存放在ASCII码文件2X.txt和2Y.txt中)
要求：根据动态规划法基本设计思想，将实现任务的C语言程序代码和运行结果填写在试卷上。
-Two strings X and Y find the longest common subsequence. (X and Y strings are stored in ASCII files 2X.txt and 2Y.txt in) requirements: According to
-
-
0下载：
计算两个字符串的最长公共子字符串的长度，使用动态规划。-Calculation of two of the longest common sub-string length of string, the use of dynamic programming.
-
-
0下载：
最长子序列,英文版,电子书 ACM文章1977+Algorithms+for+the+Longest+Common+Subsequence+Problem-The longest sequence, in English, e-books ACM article 1977+ Algorithms+ For+ The+ Longest+ Common+ Subsequence+ Problem
-
-
0下载：
Longest Common Subsequence Problem. Solution both Iterative and Recursive.
-
-
0下载：
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.
-
-
0下载：
利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem.
-
-
0下载：
Parallel Algorithms for the Longest Common Subsequence Problem
-
-
0下载：
在C++环境下开发的最长公共子序列算法，可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down
-
-
0下载：
求出所有最长公共子序列（连续序列）
输入：
malose malmose
输出：
lcs_length=3
lcs_string=ose
lcs_string=mal-ouput all the longest common subsequences. the subsequence must be series.
for example:
[input]
malose malmose
[output]
lcs_length=3
lcs_stri
-
-
0下载：
这是用c 写的关于最长公共子序列的一个算法，是学习算法分析与设计时做的一个实验，希望对初学者有用呵（原来的名字是“最长公共子序列”，因为上传的原因改成现在的名字）-This is c written about one of the longest common subsequence algorithm, learning algorithm is to do analysis and design an experiment, I hope useful for beginners O (t
-
-
0下载：
求两个子序列是最长公共子序列并输出到文件中。input.txt中的格式为X={A,B,C,D},Y={B,D}。-Find two sub-series is the longest common subsequence and output to a file. input.txt in the form X = {A, B, C, D}, Y = {B, D}.
-
-
0下载：
这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，DP背包问题-This is a test algorithm design and analysis programs, dynamic programming source code. Rising sequence containing the longest, longest common subsequence, maximum field and problems, DP knapsac
-
-
0下载：
最长公共子序列递归算法，最长限制是10000字符-Longest common subsequence of a recursive algorithm, the maximum limit is 10,000 characters
-
-
1下载：
本代码是算法设计中的最长公共子序列问题，通过C++编写。-This code is the longest common subsequence algorithm design, written by C++.
-
-
0下载：
运用动态规划思想和策略，解决最长公共子序列问题。-The use of dynamic programming ideas and strategies to solve the longest common subsequence problem.
-
-
0下载：
最长公共子序列问题 第一步 最优子结构: 第二步：建立递归式 第三步：计算最优值 -The longest common subsequence problem
-
-
0下载：
本代码实现了算法导论书中最长公共子序列算法。-The longest common subsequence
-
-
0下载：
VC++实现最长公共子序列的查找定位，简单易懂-The longest common subsequence
-
-
0下载：
用动态规划思想设计实现最长公共子序列问题，用贪心思想设计实现活动安排问题，并且用不同数据量进行对比分析。(We use dynamic programming theory to design the longest common subsequence problem. We use greedy thought to design the activity scheduling problem, and compare it with different data volume.)
-
