搜索资源列表
-p2
- 最长公共子序列（LCS），最长递增子序列（LIS），最长公共递增子序列（LCIS）的实现，根据《算法导论》英文版的伪代码改写成C语言版本，测试完美通过。-The longest common sub-sequence (LCS), the longest increasing subsequence (LIS), the longest sequence of public increments (LCIS) of the realization, according to " Intr
lcs
- CommunicatorWebAccess全套开发部署文档.-CommunicatorWebAccess the development and deployment of a full set of documentation.
LCS
- LCS programing.using c-LCS programing.using c++
We.See.Diff
- an lcs algorithm for finding common string
liulina.doc
- 河南理工大学遗传算法开题报告，是关于Holland提出的LCS理论 -Henan Polytechnic University, genetic algorithm problem that the report is on the LCS theory proposed by Holland
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
- 这是一个合并两个文件的工程，用来将两个文件合并，相同部分保留一次，不同部分一次写入，其中利用了求最大公共子序列的算法-This is a merger of the two files works, used to merge two files, the same part of the reservation time, different parts of the write-once, which demand the greatest advantage of the common s
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.
LSC(full)
- lcs 求出全部的最长公共子序列,实验程序全部采用Java实现，编译器为J2SE SDK 1.5.0_06，集成环境为Eclipse 3.1.2。-lcs find all of the longest common subsequence, experimental procedure used in all Java implementation, the compiler for the J2SE SDK 1.5.0_06, an integrated environment for Ec
lcs
- this is an important document. please verify this.