搜索资源列表
lcs
- 大二课程算法设计技巧与分析的实验,实现最长公共子序列-Two course design skills and analysis algorithm, the longest public son experiment
LCS
- 最长公共子序列问题描述与实验目的： 序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相应的递增下标序列为<2，3，5，7>。 一般地，给定一个序列X=<x1,x2,…,xm>，则另一个序列Z=<z1,z2,…,zk>是X的子序列，是指存在一个严格递增的下标序列〈i1,i2,…,ik〉使得对于所有j=1,2,…,k使Z中第j个元素zj与X中第ij个元素相同。 给定2个序列X和Y，当另一序列Z既是X
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(最长公共子序列）有关算法 详解 -Something about LCS
LCS
- 最长公共子序列也称作最长公共子串(不要求连续)，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列-Longest common subsequence, also known as the longest common strings (does not require continuous), the English abbreviat
LCS
- LCS 动态归划解决char 类型的最长字符串的匹配问题-LCS program to solve dynamic return type char longest matching string
LCS
- lcs 源码，求出所有的最长公共子序列！不足之处请大家指点@-lcs source, find the longest common subsequence of all! Inadequate guidance please!
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
Find-LCS
- 设计一个程序求出两个子序列的最长公共子序列-Design an algorithm to find all LCS
lcs
- lcs用来求两个字符串的最长公共子串。 -lcs of two strings to find the longest common string.
LCS
- 用Java实现的LCS最大公共子序列算法，输入从文件中读取ASCII码-LCS common subsequence algorithm implemented in Java, the input is read from the file in ASCII
LCS-program
- 求最长公共子序列Seeking the longest common subsequence-Seeking the longest common subsequence LCS program
LCS
- 求解所有的最大公共子序列，用于比较两个各字符串-All of LCS
lcs
- 利用lcs进行的两个字符串的最长公共子序列查找。-Longest common subsequence Find the use of two strings lcs.
LCS
- LCS and tokenizer to find the longest sequence and make a sample word DB from articles.-LCS and tokenizer to find the longest sequence and make a sample word DB from articles.
LCS
- 最长公共子序列算法LCS实现。任意输入两个字符串，通过此算法可以找到最长的公共子序列的长度，并且输出全部的最长公共子序列。-The longest common subsequence algorithm LCS. Any two input strings, this algorithm can be found in the length of the longest common subsequence, and output the longest common subsequence.
LCS
- 最长公共子序列，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列。-The longest common subsequence, the English abbreviation for the LCS (Longest Common Subsequence). Which is defined as a sequence S, are
LCS
- LCS 最长公共子序列。一个序列，如果是两个或多个已知序列的子序列，且是所有子序列中最长的，则为最长公共子序列。-LCS longest common subsequence. A sequence, if two or more sub-sequences of known sequences, and is the longest of all the sub-sequences, for the longest common subsequence.