搜索资源列表
公共子序列
- 本算法实现的是对两个单字符串的扫描，找出其最长公共子序列。-the algorithm to achieve the two-string scan, identify its longest public sequences.
最长公共子序列
- 动态规划算法中的最长公共子序列算法-dynamic programming algorithm for the longest sequence of public Algorithm
公共子序列
- 求公共子序列，字符序列的子序列是由删除该序列任意位置的任意个元素而得。值得一看的代码。-seeking public sequences, character sequences sequences deleted from the location of arbitrary sequences of arbitrary elements derived. This text code.
最长公共子序列
- 最长公共子序列： 序列Z=是序列X=的子序列，相应的递增下标序列为。 一般地，给定一个序列X=，则另一个序列Z=是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。
最长公共子序列
- 用动态规划算法求两个序列的最长公共子序列。
lcs2
- 用分治法求出两个字符串中的最长公共子序列，输出长度，并输出最终序列-Calculated by sub-rule 2 of the longest string common sub-sequence, the output length, and output the final sequence
LCSwithDynamicPrograming
- 关于求公共子序列问题的动态规划方法及实现源码.-With regard to the issue of seeking common sub-sequence dynamic programming method and the realization of source.
longest
- 这是暑假写的最长公共子序列算法，呵呵， 欢迎大家来下载-Writing This is the longest summer vacation of public sequence algorithm, huh, huh, welcome everyone to download
zuichanggonggongzixulie
- 最长公共子序列- The longest common sub-sequence
largestpublicarray
- 求出任意两个序列的最长公共子序列,使用了动态规划的方法-Obtained the longest sequence of any two common sub-sequences, the use of dynamic programming methods
TheLongestCommonSubsequence
- 本代码是用c#来实现最长公共子序列算法。-The c# code is used to achieve the longest common sub-sequence algorithm.
LCS
- 最长公共子序列(LCS)算法 求两个字符串的最长公共子序列。 X的一个子序列是相应于X下标序列{1, 2, …, m}的一个子序列，求解两个序列的所有子序列中长度最大的，例如输入：pear, peach输出：pea。 -LCS
LCSDP
- 最长公共子序列问题的动态规划算法，vc实现。-The longest common sub-sequence dynamic programming algorithm for the problem, vc achieve.
maxsubsequee
- 最长公共子序列：输入两个字符串，找出最大的公共序列。-The longest common sub-sequence: Enter the two strings, find the largest public sequence.
finddepth
- 集合算法，最优二分搜索树，最长公共子序列，union—find算法的应用与推广-Collection algorithm, the optimal binary search tree, the longest common subsequence, union-find algorithm of the application and promotion of
resoures
- “最长公共子序列问题”的三种重要实现方法，源代码-" Longest common subsequence problem" to achieve three important ways, the source code! ! ! !
LCS
- 在C++环境下开发的最长公共子序列算法，可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down
最长公共子序列
- 定义两个字符串，运用动态规划算法求出两个字符串的最长公共子序列(Finds the longest common subsequence of two strings)
LCS
- 求解最长公共子序列，要求输入10个字符 ，用C语言(Solving the longest common subsequence, asking for 10 characters, using the C language)
Longest common subsequence
- 用动态规划思想设计实现最长公共子序列问题，用贪心思想设计实现活动安排问题，并且用不同数据量进行对比分析。(We use dynamic programming theory to design the longest common subsequence problem. We use greedy thought to design the activity scheduling problem, and compare it with different data volume.)