Location:
Search - lcs
Search list
Description: LCS Algorithm, this is a c++ code for lcs(Longest Common Subsequence)
Platform: |
Size: 8104 |
Author: 劉逸 |
Hits:
Description: lcs码系统仿真，matlab7.0编译通过，通过仿真可以了解不同参数下，信号衰耗程度
Platform: |
Size: 1047 |
Author: 李好 |
Hits:
Description: 最长公共子序列算法LCS实现。任意输入两个字符串，通过此算法可以找到最长的公共子序列。
Platform: |
Size: 1139 |
Author: oscarfuture |
Hits:
Description: 本程序计算两个序列的最长公共子序列LCS
Platform: |
Size: 1074 |
Author: djz |
Hits:
Description: LCS,即最常公共子序列的的C语言解法。prepare_for_backdate(char，char，int，int)函数是为后面的回溯法求得最长公共子序列做准备，并可得到子序列长度。lcs(char，int，int)函数是输出子序列的。并用到了第一个函数的结果。因为要得到最终的子序列，要知道那些地方是可输出的位置，因此构造数组b[][]，当为1时表明当前位置匹配，可输出，为2时需要往上回溯，为3时需要往左回溯，直到找到下一个为1的位置。而c[][]数组是保存找子序列过程中匹配位数。
Platform: |
Size: 738514 |
Author: 向冬冬 |
Hits:
Description: LCS Longest (maximum) common subsequence
Platform: |
Size: 1489 |
Author: 鲁剑锋 |
Hits:
Description: LCS（最长公共子序列）问题可以简单地描述如下：
一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。例如，若X={A，B，C，B，D，B，A}，Y={B，D，C，A，B，A}，则序列{B，C，A}是X和Y的一个公共子序列，但它不是X和Y的一个最长公共子序列。序列{B，C，B，A}也是X和Y的一个公共子序列，它的长度为4，而且它是X和Y的一个最长公共子序列，因为X和Y没有长度大于4的公共子序列。
最长公共子序列问题就是给定两个序列X={x1,x2,...xm}和Y={y1,y2,...yn}，找出X和Y的一个最长公共子序列。对于这个问题比较容易想到的算法是穷举，对X的所有子序列，检查它是否也是Y的子序列，从而确定它是否为X和Y的公共子序列，并且在检查过程中记录最长的公共子序列。X的所有子序列都检查过后即可求出X和Y的最长公共子序列。X的每个子序列相应于下标集{1,2,...,m}的一个子集。因此，共有2^m个不同子序列，从而穷举搜索法需要指数时间。
-LCS (longest public sequences) can be simply described as follows : given a sequence of sequences in the sequence is deleted after some element of the sequence. Given two sequences X and Y, Z is another sequence of the X-Y sequence is the sequences, Z is said X and Y series of public sequences. For example, if X = (A, B, C, B, D, B, A), (Y = B, D, C, A, B, A), the sequence (B, C, A) X and Y is a public sequences, it is not X and Y in a public longest sequences. Sequence (B, C, B, A) X and Y is a public sequences, and its length is 4. but it is the X and Y for a public longest sequence, X and Y because no greater than the length of the four sequences in public. The longest public sequences problem is given two sequences X = (x1, x2, ...) xm and Y = (y1, y2, ... yn), to identify X and Y in a
Platform: |
Size: 4096 |
Author: 汤烈 |
Hits:
Description: 算法实现题 最长公共子序列问题
给定两个序列
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 }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )
Platform: |
Size: 1024 |
Author: sanfy chen |
Hits:
Description: 最大公共子序列，利用动态规划实现
just enjoy it-The largest common sub-sequences, the use of dynamic programming realize just enjoy it
Platform: |
Size: 1024 |
Author: 里强 |
Hits:
Description: 最大公共子序列
采用动态规划发，下载即可运行，欢迎改正-The largest common sub-sequences using dynamic programming hair, download your run, welcome correction
Platform: |
Size: 1024 |
Author: 哈哈 |
Hits:
Description: 使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进-The use of dynamic programming methods, to achieve the longest common sub-sequence algorithms, and dynamic programming methods of time and space to improve
Platform: |
Size: 269312 |
Author: 小波 |
Hits:
Description: KMP算法实现最长公共子序列的C++算法-KMP algorithm realize the longest common sub-sequence of C++ Algorithm
Platform: |
Size: 11264 |
Author: 王鹏程 |
Hits:
Description: STL风格LCS算法
STL style LCS algorithm -STL-style LCS algorithm STL style LCS algorithm
Platform: |
Size: 1024 |
Author: antss |
Hits:
Description: 最优自序列问题，对动态规划有更深的理解，用C的方式实现-Since the issue of optimal sequencing of dynamic programming has a deeper understanding of the way using C
Platform: |
Size: 1024 |
Author: 王菲 |
Hits:
Description: 实现求解整数的递增子序列。给出一串整数，求解其最长递增子序列。-Realize incremental solving integer sequence. Given a string of integers, solving the longest increasing subsequence.
Platform: |
Size: 324608 |
Author: wu |
Hits:
Description: 后缀数组的资料在国内还是少有的，是种很高效数据结构，用来求LCS很方便-Suffix array of information at home or rare, is a very efficient data structure, used for easy LCS
Platform: |
Size: 2048 |
Author: sinamaster |
Hits:
Description: 求两个字符串的最长公共子序列，使用递归算法实现。-For two of the longest common sub-string sequences, using the recursive algorithm.
Platform: |
Size: 288768 |
Author: 梁海金 |
Hits:
Description: CommunicatorWebAccess全套开发部署文档.-CommunicatorWebAccess the development and deployment of a full set of documentation.
Platform: |
Size: 2212864 |
Author: wanglei |
Hits:
Description: LCS programing.using c-LCS programing.using c++
Platform: |
Size: 1024 |
Author: gc |
Hits: