搜索资源列表
longest-common-string
- 这是动态规划中，求最长公共子序列（Longest common string）的源代码。自己编写执行。程序简单，有注释。
longest common substring
- 该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the complexity of O (n * m).
HW2.rar
- we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic programming.,we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic pro
1977+Algorithms+for+the+Longest+Common+Subsequence
- 最长子序列,英文版,电子书 ACM文章1977+Algorithms+for+the+Longest+Common+Subsequence+Problem-The longest sequence, in English, e-books ACM article 1977+ Algorithms+ For+ The+ Longest+ Common+ Subsequence+ Problem
TheLongestCommonSubsequence
- 本代码是用c#来实现最长公共子序列算法。-The c# code is used to achieve the longest common sub-sequence algorithm.
lcs
- Longest Common Subsequence Problem. Solution both Iterative and Recursive.
project1
- Constrained LCS. Given two sequences X, Y and a constrained sequence P, a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest subsequence of X and Y such that P is a subsequence of Z.
xulie
- 利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem.
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
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.
The-longest-common-subsequence-
- 最长公共子序列问题 第一步 最优子结构: 第二步：建立递归式 第三步：计算最优值 -The longest common subsequence problem
Longest-Common-Subsequences
- Longest Common Subsequences
longest-common-subsequence
- 本代码实现了算法导论书中最长公共子序列算法。-The longest common subsequence
The-longest-common-substring
- 最长公共子串，包括一个动态规划法的两个字符串最长公共子串的计算，和多个字符串最长公共子串的C代码-Longest common substring, including two strings of a dynamic programming method of computing the longest common substring, and multiple string longest common substring of C code
Longest-common-substring
- 求两个输入序列的最长的公共子字符串的长度。子字符串中的所有字符在源字符串中必须相邻。-Length of the input sequence is the sum of two longest common substring. Substring of all the characters in the source string must be contiguous.
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.)