搜索资源列表
stl.LCS
- 参考算法导论写的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
LCS
- LCS Algorithm以c#來實作，對於在學習algorithm的人們可以用這個程式來demo看看，是以VS2005開發。
STLLCS
- STL风格LCS算法 STL style LCS algorithm
LCS.rar
- 求两个字符串的最长公共子序列，使用递归算法实现。,For two of the longest common sub-string sequences, using the recursive algorithm.
LCS
- 算法：（用c++编写）设计一个算法求出全部的LCS，分析最坏情况。用”会计方法”证明,利用b[i,j]来求所有LCS的算法（在VS2008平台上） -Algorithm: (written with c++) design an algorithm find all of the LCS, the worst-case analysis. With the " accounting method" to prove the use of b [i, j] to seek a
All_Lcs
- 设计一个算法求出全部的LCS，分析最坏情况。 用”会计方法”证明,利用b[i,j]来求所有LCS的算法 在最坏情况下时间复杂度为O( )。 -Designed an algorithm to find all of the LCS, the worst-case analysis. Use " accounting methods" to prove the use of b [i, j] to seek all the LCS algorithm in the w
We.See.Diff
- an lcs algorithm for finding common string
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
- 算法动态规划最长公共子序列的递归实现，并包括查找过程的体现-Dynamic programming algorithm for the longest common subsequence of the recursive implementation, and includes the process to find a manifestation of
LCS
- LCS算法；即公共串匹配算法； 好了；不说了-LCS algorithm that public string matching algorithm
LCS
- 算法设计与分析课程中用动态规划算法求解最长公共子序列问题，C语言写的，很实用，有b数组和c数组的输出，很适合初学者一步一步走程序。-Algorithm design and analysis programs using dynamic programming algorithm for solving the longest common subsequence problem, C language written, very practical, with b and c array ar
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
LCSProblem
- LCS算法: 通常两个字符串的最大公共子串的问题是通过下面的算法来完成的： 把字符串1（长度m）横排，串2（长度n）竖排，得到一个m×n的矩阵c，矩阵的每个元素的值如下，如果m[i]=n[j]，则c[j][i]=1,否则，c[j][i]=0。然后找出矩阵中连续是1的对角线最长的一个，则对角线的长度就是公共子串的长度.-LCS algorithm: often the two most common sub-string string problem is through the fol
lcs
- 大二课程算法设计技巧与分析的实验,实现最长公共子序列-Two course design skills and analysis algorithm, the longest public son experiment
LCS
- 利用动态规划算法寻找两个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
LCS
- 经典算法lcs的实现代码，采用的是c++,在vc6.0上编译的，附带有实验报告。-The realization of the classical algorithm LCS code, the are c++, compiled in vc6.0, accompanied by experiment report.
LCS-algorithm
- LCS算法结构的描述与说明，使用源代码形式具体描述算法的实现问题-LCS algorithm
LCS
- 设计一个算法来求出两个子序列的全部的LCS-Design an algorithm to find all LCS
lcs
- 基于C语言编程的最长公共子序列搜索（lcs）算法-Based on the C programming language longest common subsequence search (lcs) algorithm