Search - Common Subsequence

Search - Common Subsequence - List

[Software Engineering] LCS(c++) DL : 0: LCS Algorithm, this is a c++ code for lcs(Longest Common Subsequence)
Date : 2025-07-16 Size : 8kb User : 劉逸
[Data structs] LCS DL : 0: 使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进-The use of dynamic programming methods, to achieve the longest common sub-sequence algorithms, and dynamic programming methods of time and space to improve
Date : 2025-07-16 Size : 263kb User : 小波
[ActiveX/DCOM/ATL] lcs DL : 0: LCS Longest (maximum) common subsequence -LCS Longest (maximum) common subsequence
Date : 2025-07-16 Size : 1kb User : 鲁剑锋
[ActiveX/DCOM/ATL] common_subsequence DL : 0: 计算两个字符串的最长公共子字符串的长度，使用动态规划。-Calculation of two of the longest common sub-string length of string, the use of dynamic programming.
Date : 2025-07-16 Size : 1kb User : 金鹰翰
[Other] 1977+Algorithms+for+the+Longest+Common+Subsequence DL : 0: 最长子序列,英文版,电子书 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
Date : 2025-07-16 Size : 700kb User : 张启达
[ActiveX/DCOM/ATL] lcs DL : 0: Longest Common Subsequence Problem. Solution both Iterative and Recursive.
Date : 2025-07-16 Size : 1kb User : gowdd
[ActiveX/DCOM/ATL] project1 DL : 0: 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.
Date : 2025-07-16 Size : 7kb User : Austin
[Other] xulie DL : 0: 利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem.
Date : 2025-07-16 Size : 1.01mb User : hehuiling
[Documents] LSC(full) DL : 0: lcs 求出全部的最长公共子序列,实验程序全部采用Java实现，编译器为J2SE SDK 1.5.0_06，集成环境为Eclipse 3.1.2。-lcs find all of the longest common subsequence, experimental procedure used in all Java implementation, the compiler for the J2SE SDK 1.5.0_06, an integrated environment for Eclipse 3.1.2.
Date : 2025-07-16 Size : 5kb User : randoll
[matlab] Babu_N_Parallel_Algorithms_for_the_Longest_Common DL : 0: Parallel Algorithms for the Longest Common Subsequence Problem
Date : 2025-07-16 Size : 83kb User : naz
[Mathimatics-Numerical algorithms] LCS DL : 0: 在C++环境下开发的最长公共子序列算法，可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down
Date : 2025-07-16 Size : 552kb User : Nango
[Data structs] most-common-subsequence-string DL : 0: 算法设计类源码。使用动态规划的方式计算两个字符串的最大公共子序列。-Algorithm design class source code. Calculated using dynamic programming the two most common subsequence string.
Date : 2025-07-16 Size : 2kb User : lixu
[Data structs] Dynamic-Programming DL : 0: 这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，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 knapsack problem
Date : 2025-07-16 Size : 2kb User : 林达
[Data structs] longest-substring DL : 0: 最长公共子序列递归算法，最长限制是10000字符-Longest common subsequence of a recursive algorithm, the maximum limit is 10,000 characters
Date : 2025-07-16 Size : 2kb User : zibin_lee
[Data structs] The--longest-common-subsequence DL : 0: 本代码是算法设计中的最长公共子序列问题，通过C++编写。-This code is the longest common subsequence algorithm design, written by C++.
Date : 2025-07-16 Size : 1kb User : 随波
[Data structs] The-longest-common-subsequence DL : 0: 运用动态规划思想和策略，解决最长公共子序列问题。-The use of dynamic programming ideas and strategies to solve the longest common subsequence problem.
Date : 2025-07-16 Size : 1kb User : 吕子乔
[Other] The-longest-common-subsequence- DL : 0: 最长公共子序列问题第一步最优子结构: 第二步：建立递归式第三步：计算最优值 -The longest common subsequence problem
Date : 2025-07-16 Size : 2kb User : 周能
[Other] Common-Subsequence DL : 0: poj 1458 A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a subsequence of X if there exists a strictly increasing sequence < i1, i2, ..., ik > of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.-A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > is a subsequence of X if there exists a strictly increasing sequence < i1, i2, ..., ik > of indices of X such that for all j = 1,2,...,k, xij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.
Date : 2025-07-16 Size : 517kb User : cam
[AI-NN-PR] longest-common-subsequence DL : 0: 本代码实现了算法导论书中最长公共子序列算法。-The longest common subsequence
Date : 2025-07-16 Size : 1kb User : flxyd
[Data structs] Longest common subsequence DL : 0: 用动态规划思想设计实现最长公共子序列问题，用贪心思想设计实现活动安排问题，并且用不同数据量进行对比分析。(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.)
Date : 2025-07-16 Size : 1kb User : lcy2074

« 12 3 4 5 6 7 8 9 10 »