搜索资源列表
stl.LCS
- 参考算法导论写的LCS算法，仿照STL的泛型风格，适用于多种STL容器中的各种类型数据构成的序列的最大公共子序列（Longest Common Subsequence）问题求解。-reference Introduction to write the algorithm LCS algorithm, modeled on the STL Generic style. STL is applicable to many types of containers data constitute the
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
test1_2
- 求X和Y两个字符串的最长公共子序列。（X和Y字符串分别存放在ASCII码文件2X.txt和2Y.txt中) 要求：根据动态规划法基本设计思想，将实现任务的C语言程序代码和运行结果填写在试卷上。 -Two strings X and Y find the longest common subsequence. (X and Y strings are stored in ASCII files 2X.txt and 2Y.txt in) requirements: According to
aa
- 用线性空间实现最长公共子序列的程序，用C++完成，程序不长，但功能完善，考虑了边界-Linear space to achieve the longest common sub-sequence of procedures, using C++ Completed, the program is not long, but with perfect functions and taking into account the boundary
common_subsequence
- 计算两个字符串的最长公共子字符串的长度，使用动态规划。-Calculation of two of the longest common sub-string length of string, the use of dynamic programming.
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
LCS
- 这是运用C++语言实现的有关最长公共子序列LCS问题的详细求解代码，大家可以下载看看，谢谢！-This is the use of C++ Language of the longest common sub-sequence of LCS to solve the problem in detail code, you can download and see, thank you!
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. The LCS must contain am, we h
houzhui_tree
- 本代码是对后缀树进行构建，然后对构建的后缀树进行一些简单操作，运用后缀树计算最长子序列-create the tiretree ,then calculate the longest common squenece of two string by using tiretree
zuichanggonggongzixulie
- 最长公共子序列- The longest common sub-sequence
LCS
- LCS问题就是求两个字符串最长公共子串的问题。解法就是用一个矩阵来记录两个字符串中所有位置的两个字符之间的匹配情况，若是匹配则为1，否则为0。然后求出对角线最长的1序列，其对应的位置就是最长匹配子串的位置。 最长递增子序列LCS的实现C源码！-LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two
TheLongestCommonSubsequence
- 本代码是用c#来实现最长公共子序列算法。-The c# code is used to achieve the longest common sub-sequence algorithm.
array
- 算法的一种，找出两个字符序列中最长的共同子序列，并输出。-An algorithm to identify the two character sequence of the longest common subsequence, and output.
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.
longest
- 求两个子序列是最长公共子序列并输出到文件中。input.txt中的格式为X={A,B,C,D},Y={B,D}。-Find two sub-series is the longest common subsequence and output to a file. input.txt in the form X = {A, B, C, D}, Y = {B, D}.
The-longest-common-subsequence-
- 最长公共子序列问题 第一步 最优子结构: 第二步：建立递归式 第三步：计算最优值 -The longest common subsequence problem
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.