搜索资源列表
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
- 算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }
LCS
- 使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进
LCS
- KMP算法实现最长公共子序列的C++算法
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
LCS
- 最长公共子序列(LCS)算法 求两个字符串的最长公共子序列。 X的一个子序列是相应于X下标序列{1, 2, …, m}的一个子序列,求解两个序列的所有子序列中长度最大的,例如输入:pear, peach输出:pea。 -LCS
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
- 这是一个合并两个文件的工程,用来将两个文件合并,相同部分保留一次,不同部分一次写入,其中利用了求最大公共子序列的算法-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
LCS
- LCS算法;即公共串匹配算法; 好了;不说了-LCS algorithm that public string matching algorithm
LCS
- 在C++环境下开发的最长公共子序列算法,可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down
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-algorithm
- LCS算法结构的描述与说明,使用源代码形式具体描述算法的实现问题-LCS algorithm
The-LCS-algorithm
- LCS算法实现简单中文文本相似度分析-最大公共子串-The LCS algorithm to implement a simple text similarity analysis- the largest public substring
lcs
- 这是一个实现lcs算法问题的java代码,其中有比较简单的swing和AWT的使用,但是算法是成功的可以借鉴-This is a realization of java code lcs algorithm for the problem, which has a relatively simple swing and AWT use, but the algorithm can learn to be successful
LCS
- 计算最长公共子序列,可以用于计算最长公共子序列(dfa s f g as dvd sag as dg)
LCS
- 用于求解两个串的最长公共子序列,输入两个字符串,从中找到最长的公共子序列。(You can search for the longest common subsequence of two strings,the longesi string is a string that two strings all include.)