搜索资源列表
lcs
- 动态规划 最长子字符串匹配 可以输出多个匹配的子字符串 算法导论-Dynamic programming longest substring matching substring can output multiple matches Introduction to Algorithms
LCS
- 寻找最长公共子序列的的VC++实现，使用VC6编写，采用了MFC库；输入两个字符串，输出最长子序列长度和最长子序列都有哪些-Find the longest common subsequence VC++ achieved using VC6 prepared using the MFC library What two input strings, the output longest sub-sequence length and the longest subsequence
LCSSolveCommonSequence
- 用备忘录方法求两个序列的最长公共子序列,并对LCS的过程进行详细的格式化的输出，最后输出最长公共子序列及其长度。-Memorandum method for solving two sequences with the longest common subsequence
LCS
- 我写的一个最长公共子序列的C语言代码，参照了算法导论上的介绍。-I wrote a longest common subsequence of C language code, referring to the presentation on Introduction to Algorithms.
Lcs
- 求最长公共子序列。本算法使用动态规划算法，解得最长公共子序列问题。-Find the longest common subsequence. The algorithm uses a dynamic programming algorithm, the solution was the longest common subsequence problem.
lab4
- 最长递增子序列 问题描述： 随机生成小于等于n的自然数的一个序列， 输出其最长递增子序列（任意一个即可）。 n 分别取 1000，3000，10000。 例： n=5 随机序列为 5 1 4 2 3，正确输出为1 2 3， 即长度为3的递增子序列。 提示：参考LCS，思考能否达到时间复杂度（O(nlogn)） -Longest increasing subsequence problem descr iption: randomly generate
Lcs_Nakatsu
- 最长公共子序列的Nakatsu算法 最长公共子序列(Longest Common Subsequence，LCS)是将两个给定字符串分别删去零个或多个字符后得到的长度最长的相同字符序列。 -Nakatsu longest common subsequence algorithm is the longest common subsequence (Longest Common Subsequence, LCS) is given two strings are deleting ze
lcs_length
- lcs-search 查找两个字符串的最长公共子串-implementation of searching maxium sub-sequence of two character string.
LCS
- 该程序用于求两个序列的最长子段，通过动态规划算法，记录子问题的结果，进而求出最终的最长子段。-The procedure used to find the longest sequence of two sub-sections, through dynamic programming algorithm to record the results of sub-problems, and then find the longest sub-section final.
LCS
- 在C++ Builder环境下比较两个字符串，并取出其中最长的公共子串。-In C++ Builder environment to compare two strings and remove one of the longest common subsequence.
CHAUNGYUSHUZUDEYINGYING
- 串和数组的应用——编辑距离ld与求最长公共子串lcs算法(动态长度)-IT IS
LCS_Dynamic-planning
- 动态规划应用 动态规划算法解最长公共子序列LCS问题-Dynamic programming dynamic programming algorithm for solving the longest common subsequence LCS problem
LCS
- 优化的最长公共子序列算法，可以输出优化值得矩阵以及最后结果-Longest common subsequence algorithm optimization, you can optimize the output matrix and the final result is worth
lcs
- Linux for S 390 Lan Channel Station Network Driver.
lcs
- 基于python语言的最长公共子序列查找算法，不仅实现了两个序列的，而且实现了三个序列的-Finding the longest common sequence based algorithm python language, not only the two sequences, and implements three sequences
lcs
- Enum for classifying detected devices.
LCS
- 使用贪心算法解决了图论算法中的最大点集覆盖问题-Greedy algorithm using graph theory algorithms to solve the biggest point set covering problem
class09
- 自己实现的一个LCS最长公共子序列算法，参考算法导论第三版进行实现-An LCS longest common subsequence algorithm to achieve their own, refer to the third edition of Introduction to Algorithms were realized
introduction-to-algorithms-code
- 1st：快排序算法及优化(7.4-5)； 2nd：红黑树插入算法； 3rd：区间树上的重叠区间查找算法； 4th：求最近点对算法； 5th：最长公共子序列(LCS)算法； 6th：Huffman编码问题； -introduction to algorithms code
LCS
- （1） 掌握多模式匹配方法 （2） 掌握基于双数组-自动机原理的多模式匹配原理 -(1) master multi-mode matching method (2) based on the dual control array- automatic machine principle of multi-mode matching principle