搜索资源列表
-
0下载：
集合算法，最优二分搜索树，最长公共子序列，union—find算法的应用与推广-Collection algorithm, the optimal binary search tree, the longest common subsequence, union-find algorithm of the application and promotion of
-
-
0下载：
求最长公共子序列的算法-Seeking the longest common subsequence algorithm
-
-
0下载：
implementation of longest common subsequence for 3 string input-implementation of longest common subsequence for 3 string input
-
-
0下载：
找出所有符合条件的的最长公共子序列，应用C++编写-To identify all eligible longest common subsequence, application C++ to prepare
-
-
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下载：
A program to find the LCS(Longest common subsequence ). It contains a source code the .c file input file .txt and the output file
-
-
0下载：
Longest Common Subsequence
A simple way of finding the longest increasing subsequence is to use the Longest Common Subsequence (Dynamic Programming) algorithm.
1. Make a sorted copy of the sequence A, denoted as B. O(nlog(n)) time.
2.
-
-
0下载：
算法导论中最长公共子序列的实现，采用动态规划方法-Introduction to Algorithms in the realization of the longest common subsequence, dynamic programming method
-
-
0下载：
求解序列的最长公共子序列问题，使用滚动数组的方法-Solve the sequence of the longest common subsequence problem, use the scroll method for array
-
-
0下载：
利用动态规划算法寻找两个list中的最长公共子序列，并分别记录了最长公共子序列的在list中的结束位置-Dynamic programming algorithm to find the two list the longest common subsequence, and recorded the longest common subsequence of the end position in the list
-
-
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,B,D,A,B}
Y={B,D,C,A,B,A}
——要求给出X、Y的最长公共子序列Z，程序运行结束时，将计算结果输出到文件output.txt中。输出文件中包含问题的答案：找不到公共子序列时给出“null” 。
-Longest common subsequence problem LCS (dynamic programming) experimental data:
-
-
0下载：
用动态规划算法求最长公共子序列，并将结果输出到文件中-Using dynamic programming algorithm for getting the longest common subsequence, and the results output to a file
-
-
0下载：
最长公共子序列也称作最长公共子串(不要求连续)，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列-Longest common subsequence, also known as the longest common strings (does not require continuous), the English abbreviat
-
-
0下载：
用C++实现最长公共子序列算法的程序清单-Using C++, the longest common subsequence algorithms Listing
-
-
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下载：
用动态规划思想设计实现最长公共子序列问题，用贪心思想设计实现活动安排问题，并且用不同数据量进行对比分析。(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.)
-
