Description: 使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进-The use of dynamic programming methods, to achieve the longest common sub-sequence algorithms, and dynamic programming methods of time and space to improve Platform: |
Size: 269312 |
Author:小波 |
Hits:
Description: 计算两个字符串的最长公共子字符串的长度,使用动态规划。-Calculation of two of the longest common sub-string length of string, the use of dynamic programming. Platform: |
Size: 1024 |
Author:金鹰翰 |
Hits:
Description: 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. Platform: |
Size: 7168 |
Author:Austin |
Hits:
Description: 利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem. Platform: |
Size: 1056768 |
Author:hehuiling |
Hits:
Description: 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. Platform: |
Size: 5120 |
Author:randoll |
Hits:
Description: 在C++环境下开发的最长公共子序列算法,可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down Platform: |
Size: 565248 |
Author:Nango |
Hits:
Description: 这是用c 写的关于最长公共子序列的一个算法,是学习算法分析与设计时做的一个实验,希望对初学者有用呵(原来的名字是“最长公共子序列”,因为上传的原因改成现在的名字)-This is c written about one of the longest common subsequence algorithm, learning algorithm is to do analysis and design an experiment, I hope useful for beginners O (the original name is " the longest common subsequence" , because uploading The reason for the name change now) Platform: |
Size: 104448 |
Author:楚明阳 |
Hits:
Description: 这是算法设计与分析课程实验,动态规划的源程序。包含最长上升子序列,最长公共子序列,最大字段和问题,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 Platform: |
Size: 2048 |
Author:林达 |
Hits:
Description: 最长公共子序列递归算法,最长限制是10000字符-Longest common subsequence of a recursive algorithm, the maximum limit is 10,000 characters Platform: |
Size: 2048 |
Author:zibin_lee |
Hits:
Description: 本代码是算法设计中的最长公共子序列问题,通过C++编写。-This code is the longest common subsequence algorithm design, written by C++. Platform: |
Size: 1024 |
Author:随波 |
Hits:
Description: 运用动态规划思想和策略,解决最长公共子序列问题。-The use of dynamic programming ideas and strategies to solve the longest common subsequence problem. Platform: |
Size: 1024 |
Author:吕子乔 |
Hits:
Description: 用动态规划思想设计实现最长公共子序列问题,用贪心思想设计实现活动安排问题,并且用不同数据量进行对比分析。(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.) Platform: |
Size: 1024 |
Author:lcy2074 |
Hits: