搜索资源列表
lcs
- LCS Longest (maximum) common subsequence
common_subsequence
- 计算两个字符串的最长公共子字符串的长度，使用动态规划。-Calculation of two of the longest common sub-string length of string, the use of dynamic programming.
lcs
- Longest Common Subsequence Problem. Solution both Iterative and Recursive.
commSsq
- finds the longest common subsequence.
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.