Location:
Search - lcs
Search list
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: 4737 |
Author: 汤烈 |
Hits:
Description: - XCS for Dynamic Environments
+ Continuous versions of XCS
+ Test problem: real multiplexer
+ Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts.
+Reference papers:
H.H. Dam, H.A. Abbass, C.J. Lokan, Evolutionary Online Data Mining – an Investigation in a Dynamic Environment. 2005, accepted for a book chapter in Springer Series on Studies in Computational Intelligence
H.H. Dam, H.A. Abbass, C.J. Lokan, Be Real! XCS with Continuous-Valued Inputs. IWLCS 2005, (International Workshop on Learning Classifier Systems). Washington DC, June 2005.-- XCS for Continuous Dynamic Environments Test versions of XCS problem : real multiplexer Experiments : XCS is explored in dynamic environments with di fferent magnitudes of change to the underlying concepts. Reference papers : H. H. Dam, H. A. Abbass, C. J. Lokan. Evolutionary Online Data Mining-an Investiga tion in a Dynamic Environment. 2005. accepted for a book chapter in Springer Series o n Studies in Computational Intelligence H.H. D am, H. A. Abbass, C. J. Lokan. Be Real! XCS with Continuous - Valued Inputs. IW LCS 2005. (International Workshop on Learning Classifi er Systems). Washington DC, June 2005.
Platform: |
Size: 23001 |
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 }
Platform: |
Size: 1219 |
Author: sanfy chen |
Hits:
Description: 最大公共子序列，利用动态规划实现
just enjoy it
Platform: |
Size: 936 |
Author: 里强 |
Hits:
Description: 最大公共子序列
采用动态规划发，下载即可运行，欢迎改正
Platform: |
Size: 1095 |
Author: 哈哈 |
Hits:
Description: 使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进
Platform: |
Size: 269125 |
Author: 小波 |
Hits:
Description: KMP算法实现最长公共子序列的C++算法
Platform: |
Size: 11111 |
Author: 王鹏程 |
Hits:
Description: STL风格LCS算法
STL style LCS algorithm
Platform: |
Size: 1629 |
Author: antss |
Hits:
Description: 最优自序列问题，对动态规划有更深的理解，用C的方式实现
Platform: |
Size: 1483 |
Author: 王菲 |
Hits:
Description: 实现求解整数的递增子序列。给出一串整数，求解其最长递增子序列。
Platform: |
Size: 7541 |
Author: wu |
Hits:
Description: 后缀数组的资料在国内还是少有的，是种很高效数据结构，用来求LCS很方便
Platform: |
Size: 1891 |
Author: sinamaster |
Hits:
Description: LcsLength--java
Platform: |
Size: 1024 |
Author: 华瑞 |
Hits:
Description: 用动态怪话编写的有关最优公共秩序列问题的java程序-dynamic cynical remark prepared in the best public order out of java programs
Platform: |
Size: 1024 |
Author: |
Hits:
Description: - XCS for Dynamic Environments
+ Continuous versions of XCS
+ Test problem: real multiplexer
+ Experiments: XCS is explored in dynamic environments with different magnitudes of change to the underlying concepts.
+Reference papers:
H.H. Dam, H.A. Abbass, C.J. Lokan, Evolutionary Online Data Mining – an Investigation in a Dynamic Environment. 2005, accepted for a book chapter in Springer Series on Studies in Computational Intelligence
H.H. Dam, H.A. Abbass, C.J. Lokan, Be Real! XCS with Continuous-Valued Inputs. IWLCS 2005, (International Workshop on Learning Classifier Systems). Washington DC, June 2005.-- XCS for Continuous Dynamic Environments Test versions of XCS problem : real multiplexer Experiments : XCS is explored in dynamic environments with di fferent magnitudes of change to the underlying concepts. Reference papers : H. H. Dam, H. A. Abbass, C. J. Lokan. Evolutionary Online Data Mining-an Investiga tion in a Dynamic Environment. 2005. accepted for a book chapter in Springer Series o n Studies in Computational Intelligence H.H. D am, H. A. Abbass, C. J. Lokan. Be Real! XCS with Continuous- Valued Inputs. IW LCS 2005. (International Workshop on Learning Classifi er Systems). Washington DC, June 2005.
Platform: |
Size: 22528 |
Author: 李恆寬 |
Hits:
Description: 在Windows下采用RTC进行通信的源代码，可作为服务等多种方式交互。-used in Windows RTC communications source code, as a variety of services such as interactive way.
Platform: |
Size: 1423360 |
Author: wanggp |
Hits:
Description: 最长公共子序列算法的实现,还有实验报告，欢迎大家下载-The longest common sub-sequence algorithm, as well as experimental reports, welcomed everyone to download
Platform: |
Size: 37888 |
Author: 雷远东 |
Hits:
Description: LCS，求两个序列的最长子列，算法园子算法导论第15章-LCS introduction of algorithms
Platform: |
Size: 1024 |
Author: fengback |
Hits:
Description: 动态规划，将两个字符串结合起来，他们的公共子串只输出一次。根据LCS函数对每一步该向左、向上还是向左上对角线走的状态用state[i][j]进行标记。打印函数PrintLCS中，state[][]==1的时候，表示往左上回溯，2时往上回溯，3时往左回溯。直到i=0且j=0即到了表初始位置时结束，然后由之前的路线打印字符串。-The LCS for public the firstborn sequence.
Platform: |
Size: 1024 |
Author: 金颖 |
Hits:
Description: 计算最长公共子序列,可以用于计算最长公共子序列(dfa s f g as dvd sag as dg)
Platform: |
Size: 9305088 |
Author: 七秒记忆1
|
Hits:
Description: 用于求解两个串的最长公共子序列,输入两个字符串，从中找到最长的公共子序列。(You can search for the longest common subsequence of two strings,the longesi string is a string that two strings all include.)
Platform: |
Size: 1207296 |
Author: Carryliu |
Hits: