搜索资源列表
LCS
- LCS programing.using c-LCS programing.using c++
We.See.Diff
- an lcs algorithm for finding common string
lcs
- Longest Common Subsequence Problem. Solution both Iterative and Recursive.
LCS
- 最长公共子序列(LCS)算法 求两个字符串的最长公共子序列。 X的一个子序列是相应于X下标序列{1, 2, …, m}的一个子序列，求解两个序列的所有子序列中长度最大的，例如输入：pear, peach输出：pea。 -LCS
LCS
- 数据结构最长公共子串实现，MFC实现，界面良好-Data structure to achieve the longest common sub-string, MFC realize a good interface
AlgorithmforLCS
- 自己写的，采用VB.NET编写的最长公共子序列(LCS)算法，全图形界面，VS2005下编译通过-Wrote it myself, using VB.NET to prepare the longest common sub-sequence (LCS) algorithm, the entire graphical interface, VS2005 compiler through the next
lcs
- 一道经典的动态规划题目 浙江大学硕士生入学复试上机题 http://acm.hdu.edu.cn/showproblem.php?pid=1231-Classic dynamic programming http://acm.hdu.edu.cn/showproblem.php?pid=1231
LCS
- 算法动态规划最长公共子序列的递归实现，并包括查找过程的体现-Dynamic programming algorithm for the longest common subsequence of the recursive implementation, and includes the process to find a manifestation of
project1
- 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.
LCS_src
- Longest Common Substring LCS
LCS
- Longest common subsequence problem. It is dynamic approach based problem.
LCS
- lcs 最大公共字串 最大公共字串-lcs 最大公共字串 最大公共字串 最大公共字串
LCS
- LCS算法；即公共串匹配算法； 好了；不说了-LCS algorithm that public string matching algorithm
LCS
- 利用动态规划技术和递推的办法，求出两个字母表A和B的最大公共字串长度。-The use of dynamic programming techniques and recursive approach to find the two alphabets A and B, the largest public string length.
lcs
- this is an important document. please verify this.
LCS.tar
- LCS匹配算法,divide and conquer LCS-LCS matching algorithms, divide and conquer LCS
LCS
- 最长公共字串，寻找两个字符串的最长公共字串。-LCS
LCS
- 在C++环境下开发的最长公共子序列算法，可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down
LCS
- LCS问题具有最优子结构和重叠子问题的性质，因此采用动态规划算法自底向上计算该问题的解，并输出求到的LCS。-LCS problem with sub-optimal substructure and overlapping nature of the problem, so a bottom-up dynamic programming algorithm for computing the solution of the problem, and the output request to
lcs
- A program to find the LCS(Longest common subsequence ). It contains a source code the .c file input file .txt and the output file