Location:
Search - lcs
Search list
Description: LCS algorithm implementation in C programming Language. With detail, suitbale for beginer.
Platform: |
Size: 1024 |
Author: die4home |
Hits:
Description: 最长子序列，问题描述：
随机生成小于等于n的自然数的一个序列，输出其最长递增子序列（任意一个即可）。
n 分别取 1000，3000，10000。
例： n=5 随机序列为 5 1 4 2 3，正确输出为1 2 3，即长度为3的递增子序列。
-lcs
Platform: |
Size: 184320 |
Author: 何雯 |
Hits:
Description: 最长公共字串，寻找两个字符串的最长公共字串。-LCS
Platform: |
Size: 1024 |
Author: jinyu |
Hits:
Description: 在C++环境下开发的最长公共子序列算法，可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down
Platform: |
Size: 565248 |
Author: Nango |
Hits:
Description: 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 the LCS.
Platform: |
Size: 1024 |
Author: zhdxch |
Hits:
Description: A program to find the LCS(Longest common subsequence ). It contains a source code the .c file input file .txt and the output file
Platform: |
Size: 1024 |
Author: cbeauty |
Hits:
Description: 大二课程算法设计技巧与分析的实验,实现最长公共子序列-Two course design skills and analysis algorithm, the longest public son experiment
Platform: |
Size: 1024 |
Author: 小生 |
Hits:
Description: 最长公共子序列问题描述与实验目的：
序列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的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。
你的任务是：给定2个序列X、Y，求X和Y的最长公共子序列Z。
输入样例
2
7 6
A B C B D A B
B D C A B A
8 9
b a a b a b a b
a b a b b a b b a
输出
Case 1
4 LCS(X,Y):B C B A
Case 2
6 LCS(X,Y):a b a b a b
-Longest common subsequence problem
Description and Purpose:
Z = <B,C,D,B> sequence is the sequence X = <A,B,C,B,D,A,B> the sequence, the corresponding sequence of increasing subscript <2,3,5,7 >.
In general, given a sequence X = <x1,x2,…,xm>, then another sequence Z = <z1,z2,…,zk> is a sub-sequence of X, is the existence of a strictly increasing sequence subscript <i1,i2,…,ik> such that for all j = 1,2, ..., k so that the first j elements Z zj and X the same as the first element ij.
Given two sequences X and Y, when another sequence Z as X, Y promoter sequence is a sub sequence, said sequence of X and Y Z is the common subsequence.
Your task is: given two sequences X, Y, X and Y find the longest common subsequence Z.
Input sample
2
76
A B C B D A B
B D C A B A
89
b a a b a b a b
a b a b b a b b a
Output
Case 1
4 LCS (X, Y): B C B A
Case 2
6 LCS (X, Y): a b a b a b
Platform: |
Size: 872448 |
Author: wscnwps |
Hits:
Description: 最长公共子序列问题（LCS）（生物信息学中常用算法），该算法能求出全部的LCS-Longest common subsequence algorithm， can find all LCS
Platform: |
Size: 1181696 |
Author: pakko |
Hits:
Description: 利用动态规划算法寻找两个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
Platform: |
Size: 529408 |
Author: 滕海明 |
Hits:
Description: LCS(最长公共子序列）有关算法
详解
-Something about LCS
Platform: |
Size: 815104 |
Author: zcw |
Hits:
Description: 最长公共子序列也称作最长公共子串(不要求连续)，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列-Longest common subsequence, also known as the longest common strings (does not require continuous), the English abbreviation for the LCS (Longest Common Subsequence). Defined as a sequence S, if two or more were sub-sequence of known sequence, and is consistent with this condition all the longest sequence, then S is called the known sequence of the longest common subsequence
Platform: |
Size: 159744 |
Author: zdl |
Hits:
Description: LCS 动态归划解决char 类型的最长字符串的匹配问题-LCS program to solve dynamic return type char longest matching string
Platform: |
Size: 94208 |
Author: gle |
Hits:
Description: lcs 源码，求出所有的最长公共子序列！不足之处请大家指点@-lcs source, find the longest common subsequence of all! Inadequate guidance please!
Platform: |
Size: 4096 |
Author: 史跃珍 |
Hits:
Description: 经典算法lcs的实现代码，采用的是c++,在vc6.0上编译的，附带有实验报告。-The realization of the classical algorithm LCS code, the are c++, compiled in vc6.0, accompanied by experiment report.
Platform: |
Size: 30720 |
Author: 李玉明 |
Hits:
Description: LCS算法结构的描述与说明，使用源代码形式具体描述算法的实现问题-LCS algorithm
Platform: |
Size: 142336 |
Author: 了 |
Hits:
Description: 设计一个算法来求出两个子序列的全部的LCS-Design an algorithm to find all LCS
Platform: |
Size: 619520 |
Author: 朱月恒 |
Hits:
Description: 设计一个程序求出两个子序列的最长公共子序列-Design an algorithm to find all LCS
Platform: |
Size: 619520 |
Author: 朱月恒 |
Hits:
Description: lcs用来求两个字符串的最长公共子串。 -lcs of two strings to find the longest common string.
Platform: |
Size: 1188864 |
Author: 赵莉 |
Hits:
Description: this the LCS that means find the Longest -this is the LCS that means find the Longest
Platform: |
Size: 1024 |
Author: omid |
Hits: