搜索资源列表
NMLCS
- 本程序实现了寻找多个字符串的公共子序列问题，运用目前较先进的基于支配点的方法，时间及空间复杂度均有提高-This program implements find multiple string common subsequence problem, the use of more advanced disposable point-based approach, time and space complexity are improve
zuichanggonggongzixulie
- 最长公共子序列与最大字段和c语言版，具有图例说明结果-The longest common subsequence with maximum field and c language version, with Legend results
xulie
- 算法实验 求最长公共子序列 运行时间大概2分钟-Algorithm experiment for the longest common subsequence
lis
- 求一组数的最长上升子序列，时间复杂度为O(nlogn)-longest increase subsequence
dp_LCS
- Dynamic Programming. Finding Longest Common Subsequence.
1
- Given a positive integer n, the integers a1, a2, ..., An. Consider the sequence of segments a1, a2, ..., AN (a subsequence of consecutive terms) consisting of perfect numbers. Find the largest of the lengths of the segme
qsubsequenceiterator
- Subsequence Iterator for Embedded Linux.
STRING
- 使用分治思想，利用C语言，求得最长公共子串问题-Using Divide and Conquer, using C language, and seek the longest common subsequence problem
LCS
- LCS 最长公共子序列。一个序列，如果是两个或多个已知序列的子序列，且是所有子序列中最长的，则为最长公共子序列。-LCS longest common subsequence. A sequence, if two or more sub-sequences of known sequences, and is the longest of all the sub-sequences, for the longest common su
zuichanggonggongzichuan
- 本代码描述了寻找两个字符串的最大公共子串问题，算法描述清楚，适合初学者。-This code describes the search for two strings greatest common subsequence problem, the algorithm clearly described, suitable for beginners.
LCSSolveCommonSequence
- 用备忘录方法求两个序列的最长公共子序列,并对LCS的过程进行详细的格式化的输出，最后输出最长公共子序列及其长度。-Memorandum method for solving two sequences with the longest common subsequence
CSE321_HW05_101044035
- longest common subsequence problem-longest common subsequence problem
LCS
- lcs ,最长公共子序列，去两组字符中 LCS 最长公共子序列-lcs, longest common subsequence, to two characters in the longest common subsequence LCS
zcgzxl
- 最长公共子序列的 c代码，可以直接运行获得结果。-C code for the longest common subsequence can be run directly.
lcs
- 基于C语言编程的最长公共子序列搜索（lcs）算法-Based on the C programming language longest common subsequence search (lcs) algorithm
LPS
- 1.對input做Longest Palindrome Subsequence algorithm 2.對input做Sequence Aliment algorithm-1 for input do Longest Palindrome Subsequence algorithm 2. Sequence Aliment algorithm for input do
LCS
- 我写的一个最长公共子序列的C语言代码，参照了算法导论上的介绍。-I wrote a longest common subsequence of C language code, referring to the presentation on Introduction to Algorithms.
lcs
- 随机生成两个长度为1000的字母序列，利用动态规划算法实现求最长公共子序列，并输出最长公共子序列的长度，一般是320左右。-Two randomly generated sequence of letters of length 1000, the use of dynamic programming algorithm for the longest common subsequence, and the output length
arithmetic
- 压缩文件主要包含是10道算法编程题：强盗分赃，区间相交问题，取数对弈，删除问题，统计你序对，整除15，整数因子分解，最优自然数，最长公共子串。 里面每道题都是.txt，包含了题目具体的描述及源码实现。程序实现是在vc6.0完成编译通过。-Zip file mainly contains programming algorithm is 10 questions: robbers spoils, interval intersection
Lcs
- 求最长公共子序列。本算法使用动态规划算法，解得最长公共子序列问题。-Find the longest common subsequence. The algorithm uses a dynamic programming algorithm, the solution was the longest common subsequence problem.