搜索资源列表
LCS(c++)
- LCS Algorithm, this is a c++ code for lcs(Longest Common Subsequence)
parser
- Elimination of left factoring in the given grammar For each nonterminal A find the longest prefix (alpha) common to two or more of its alternatives.If alpha is not equal epsilon,i.e..,there is a nontrivial common prefix,replace all the A productio
111
- 最长公共子序列求解 一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。最长公共子序列就是求给定两个序列的一个最长公共子序列。动态规划可以有效的解决此问题。由最长公共子序列问题的子序列的最优子结构性质，可以建立子问题最优的递归关系。用c[i][j]记录序列Xi和Yi的最长公共子序列的长度-Solving the longest common subsequence for a given se
kmp_Ext
- 运用扩展KMP算法求出某一字符串与另一字符串的所有最长公共前缀-KMP algorithm the extended use of a string with another string of all longest common prefix
aaa
- 算法设计与分析中的最长公共子序列的c++代码，很好的解决了此算法-Longest common subsequence algorithm design and analysis c++ code, a good solution to this algorithm
Needleman-Wunsch
- 本文介绍基于最长公共子串的文本比较算法——Needleman/Wunsch算法。-In this paper, the text comparison algorithm based on the longest common substring Needleman/Wunsch algorithm
stu
- 最长公共子序列以及回文数解题报告，其中包含了几种LCS代码，和一个通用的LCS模板。有c++版和pascal版-Longest common subsequence problem solving and palindrome report, which contains several LCS code, and a generic template LCS. There c++ version and pascal version