搜索资源列表
longest-common-string
- 这是动态规划中，求最长公共子序列（Longest common string）的源代码。自己编写执行。程序简单，有注释。
LCS.rar
- 求两个字符串的最长公共子序列，使用递归算法实现。,For two of the longest common sub-string sequences, using the recursive algorithm.
-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 realization, according to " Intr
report+of+Algorithm
- 算法设计的实验报告 包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge So
MaxCommanSubsequence
- 求最长公共子序列的算法，其中包含了对该算法的讲解。-For the longest common sub-sequences algorithm, which includes explanation of the algorithm.
ac
- 最长公共子序列 问题ACM题目 如果序列 { s1, s2, ……, sk } 是序列 { a1, a2, ……, an } 的子序列，又是序列 { b1, b2, ……, bm } 的子序列，则称序列 s 为序列 a 和 序列 b 的公共子序列。在 a 和 b 的所有公共子序列中，长度最长者称为最长公共子序列。 本题对于给定的两个整数序列，请求其最长公共子序列的长度 -The question of the longest common sub-sequence if th
longest_common_sub-sequence
- 求最长公共子序列，求最长公共子序列-For the longest common sub-sequence
LCSDP
- 最长公共子序列问题的动态规划算法，vc实现。-The longest common sub-sequence dynamic programming algorithm for the problem, vc achieve.
suanf
- 算法和算法设计中的有关于求解最长公共子序列的解决方法，最终可以动态显示求解过程-Algorithms and algorithm design for solving the longest common sub-sequence of solutions, and ultimately the solution process can be dynamic display
LCS
- 数据结构最长公共子串实现，MFC实现，界面良好-Data structure to achieve the longest common sub-string, MFC realize a good interface
Babu_N_Parallel_Algorithms_for_the_Longest_Common
- Parallel Algorithms for the Longest Common Subsequence Problem
LCS
- 在C++环境下开发的最长公共子序列算法，可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down
longest_common_subsequence
- 求出所有最长公共子序列（连续序列） 输入： malose malmose 输出： lcs_length=3 lcs_string=ose lcs_string=mal-ouput all the longest common subsequences. the subsequence must be series. for example: [input] malose malmose [output] lcs_length=3 lcs_stri
Dynamic-Programming
- 这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，DP背包问题-This is a test algorithm design and analysis programs, dynamic programming source code. Rising sequence containing the longest, longest common subsequence, maximum field and problems, DP knapsac
longest-substring
- 最长公共子序列递归算法，最长限制是10000字符-Longest common subsequence of a recursive algorithm, the maximum limit is 10,000 characters
The--longest-common-subsequence
- 本代码是算法设计中的最长公共子序列问题，通过C++编写。-This code is the longest common subsequence algorithm design, written by C++.
The-longest-common-subsequence
- 运用动态规划思想和策略，解决最长公共子序列问题。-The use of dynamic programming ideas and strategies to solve the longest common subsequence problem.
Longest-Common-Subsequences
- Longest Common Subsequences
longest-common-subsequence
- 本代码实现了算法导论书中最长公共子序列算法。-The longest common subsequence
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.)