搜索资源列表
Dijkstra
- 求数组最长递增子序列算法。输入一个数组，输出其最大递增子序列-Array for the longest increasing subsequence algorithm. An array of input and output its maximum incremental sequence
LCS(c++)
- LCS Algorithm, this is a c++ code for lcs(Longest Common Subsequence)
lcs
- LCS Longest (maximum) common subsequence -LCS Longest (maximum) common subsequence
longest
- Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where
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
subsequence
- 最长子序列的求解,用于查找几个序列中最长的公共子序列，并且返回查找结果-it can be used to search a longest subsequence
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 s
LMIS
- 动态规划求解最长单调递增子序列，给出了图形界面-Dynamic programming to solve the longest monotonically increasing subsequence given the graphical user interface
xulie
- 利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem.
LSC(full)
- 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
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 [out
subsequence
- 这是用c 写的关于最长公共子序列的一个算法，是学习算法分析与设计时做的一个实验，希望对初学者有用呵（原来的名字是“最长公共子序列”，因为上传的原因改成现在的名字）-This is c written about one of the longest common subsequence algorithm, learning algorithm is to do analysis and design an experiment, I
most-common-subsequence-string
- 算法设计类源码。使用动态规划的方式计算两个字符串的最大公共子序列。-Algorithm design class source code. Calculated using dynamic programming the two most common subsequence string.
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
LIS(Longest-increasing-subsequence)
- 最长非降单调子列的实现。java写成。谢谢。-Longest increasing subsequence
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++.