搜索资源列表
10001
- Longest Ordered Subsequence,acm必备习题-Longest Ordered Subsequence, acm must Exercises
common_subsequence
- 计算两个字符串的最长公共子字符串的长度，使用动态规划。-Calculation of two of the longest common sub-string length of string, the use of dynamic programming.
lcsLength
- 给定一个数组，通过快速排序法，把数组里面的数按照从小到大进行排序，即递增序列。然后用lcsLength函数找出最长递增子序列。-Given an array by quicksort method, the number inside the array from small to large in accordance with the sort, that is, incremental sequence. LcsLength fu
LCS
- Instead of finding the longest common subsequence, let us try to determine the length of the LCS. Then tracking back to find the LCS. Consider a1a2…am and b1b2…bn. Case 1: am=bn. T
longest_subsequence
- 经典的计算最长公子序列，C语言编译，VC++下测试通过-calculate the longest public subsequence
algorithms
- 最长单调子序列、字符串比较、加油问题及背包问题的算法分析及求解-The longest monotone subsequence, string comparison, the fuel problem and knapsack problem analysis and solving algorithms
array
- 算法的一种，找出两个字符序列中最长的共同子序列，并输出。-An algorithm to identify the two character sequence of the longest common subsequence, and output.
maxsub
- 求多个字母序列的最长公共子序列的C++代码-get the maxsimum common subsequence of some subsequence
commSsq
- finds the longest common subsequence.
lcs
- 求解两个序列的最大子序列问题，以图形显示求解过程-Solving the two sequences of the largest issue of subsequence
-p2
- 最长公共子序列（LCS），最长递增子序列（LIS），最长公共递增子序列（LCIS）的实现，根据《算法导论》英文版的伪代码改写成C语言版本，测试完美通过。-The longest common sub-sequence (LCS), the longest increasing subsequence (LIS), the longest sequence of public increments (LCIS) of the realiz
LCS
- longest common subsequence implementation
finddepth
- 集合算法，最优二分搜索树，最长公共子序列，union—find算法的应用与推广-Collection algorithm, the optimal binary search tree, the longest common subsequence, union-find algorithm of the application and promotion of
LCS1
- Source code for longest comman subsequence
LCS
- long comman subsequence directory program for the beginner
zixulie
- 序列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个
kang
- 一个最长公共子序列的实现算法，编译完全正确-One of the longest common subsequence algorithm，compile completely correct
LCS
- 这是一个合并两个文件的工程，用来将两个文件合并，相同部分保留一次，不同部分一次写入，其中利用了求最大公共子序列的算法-This is a merger of the two files works, used to merge two files, the same part of the reservation time, different parts of the write-once, which demand the grea
zuichanggonggongzixuelie
- 求最长公共子序列的算法-Seeking the longest common subsequence algorithm
LCS
- 算法动态规划最长公共子序列的递归实现，并包括查找过程的体现-Dynamic programming algorithm for the longest common subsequence of the recursive implementation, and includes the process to find a manifestation of