Search - dynamic programming lcs

Search - dynamic programming lcs - List

[MultiLanguage] LCS DL : 0: 动态规划解决LCS-dynamic programming solution LCS
Date : 2008-10-13 Size : 1.53kb User : 胡凯
[MultiLanguage] LCS DL : 0: 动态规划解决LCS-dynamic programming solution LCS
Date : 2025-07-02 Size : 1kb User : 胡凯
[Data structs] LCS_Dynamic_Programming DL : 0: LCS（最长公共子序列）问题可以简单地描述如下：一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。例如，若X={A，B，C，B，D，B，A}，Y={B，D，C，A，B，A}，则序列{B，C，A}是X和Y的一个公共子序列，但它不是X和Y的一个最长公共子序列。序列{B，C，B，A}也是X和Y的一个公共子序列，它的长度为4，而且它是X和Y的一个最长公共子序列，因为X和Y没有长度大于4的公共子序列。最长公共子序列问题就是给定两个序列X={x1,x2,...xm}和Y={y1,y2,...yn}，找出X和Y的一个最长公共子序列。对于这个问题比较容易想到的算法是穷举，对X的所有子序列，检查它是否也是Y的子序列，从而确定它是否为X和Y的公共子序列，并且在检查过程中记录最长的公共子序列。X的所有子序列都检查过后即可求出X和Y的最长公共子序列。X的每个子序列相应于下标集{1,2,...,m}的一个子集。因此，共有2^m个不同子序列，从而穷举搜索法需要指数时间。 -LCS (longest public sequences) can be simply described as follows : given a sequence of sequences in the sequence is deleted after some element of the sequence. Given two sequences X and Y, Z is another sequence of the X-Y sequence is the sequences, Z is said X and Y series of public sequences. For example, if X = (A, B, C, B, D, B, A), (Y = B, D, C, A, B, A), the sequence (B, C, A) X and Y is a public sequences, it is not X and Y in a public longest sequences. Sequence (B, C, B, A) X and Y is a public sequences, and its length is 4. but it is the X and Y for a public longest sequence, X and Y because no greater than the length of the four sequences in public. The longest public sequences problem is given two sequences X = (x1, x2, ...) xm and Y = (y1, y2, ... yn), to identify X and Y in a
Date : 2025-07-02 Size : 4kb User : 汤烈
[Data structs] LCS DL : 0: 最大公共子序列，利用动态规划实现 just enjoy it-The largest common sub-sequences, the use of dynamic programming realize just enjoy it
Date : 2025-07-02 Size : 1kb User : 里强
[Data structs] LCS DL : 0: 最大公共子序列采用动态规划发，下载即可运行，欢迎改正-The largest common sub-sequences using dynamic programming hair, download your run, welcome correction
Date : 2025-07-02 Size : 1kb User : 哈哈
[Data structs] LCS DL : 0: 使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进-The use of dynamic programming methods, to achieve the longest common sub-sequence algorithms, and dynamic programming methods of time and space to improve
Date : 2025-07-02 Size : 263kb User : 小波
[Data structs] LCS DL : 0: 最优自序列问题，对动态规划有更深的理解，用C的方式实现-Since the issue of optimal sequencing of dynamic programming has a deeper understanding of the way using C
Date : 2025-07-02 Size : 1kb User : 王菲
[Mathimatics-Numerical algorithms] lcs DL : 0: 动态规划实现lcs-Dynamic programming to achieve lcs
Date : 2025-07-02 Size : 859kb User : hcsg
[Mathimatics-Numerical algorithms] LCS DL : 1: 用LCS方法解决字符匹配问题，用到动态规划的思想。原创-LCS solution with matching characters, the idea of using dynamic programming
Date : 2025-07-02 Size : 1kb User : bohu
[Console] HW2 DL : 0: we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic programming.
Date : 2025-07-02 Size : 129kb User : burcin
[Data structs] lcs DL : 0: 一道经典的动态规划题目浙江大学硕士生入学复试上机题 http://acm.hdu.edu.cn/showproblem.php?pid=1231-Classic dynamic programming http://acm.hdu.edu.cn/showproblem.php?pid=1231
Date : 2025-07-02 Size : 1kb User : 陈子杭
[Mathimatics-Numerical algorithms] LCS DL : 0: 算法动态规划最长公共子序列的递归实现，并包括查找过程的体现-Dynamic programming algorithm for the longest common subsequence of the recursive implementation, and includes the process to find a manifestation of
Date : 2025-07-02 Size : 121kb User : 孙强
[Windows Develop] LCS DL : 0: 利用动态规划技术和递推的办法，求出两个字母表A和B的最大公共字串长度。-The use of dynamic programming techniques and recursive approach to find the two alphabets A and B, the largest public string length.
Date : 2025-07-02 Size : 941kb User : 孙静
[Other] LCS DL : 0: 算法设计与分析课程中用动态规划算法求解最长公共子序列问题，C语言写的，很实用，有b数组和c数组的输出，很适合初学者一步一步走程序。-Algorithm design and analysis programs using dynamic programming algorithm for solving the longest common subsequence problem, C language written, very practical, with b and c array array output, it is suitable for beginners step by step process.
Date : 2025-07-02 Size : 1kb User : 陈丽萍
[Data structs] LCS DL : 0: LCS问题具有最优子结构和重叠子问题的性质，因此采用动态规划算法自底向上计算该问题的解，并输出求到的LCS。-LCS problem with sub-optimal substructure and overlapping nature of the problem, so a bottom-up dynamic programming algorithm for computing the solution of the problem, and the output request to the LCS.
Date : 2025-07-02 Size : 1kb User : zhdxch
[Data structs] lcs DL : 0: 算法导论中最长公共子序列的实现，采用动态规划方法-Introduction to Algorithms in the realization of the longest common subsequence, dynamic programming method
Date : 2025-07-02 Size : 556kb User : lin
[Data structs] LCS DL : 0: 利用动态规划算法寻找两个list中的最长公共子序列，并分别记录了最长公共子序列的在list中的结束位置-Dynamic programming algorithm to find the two list the longest common subsequence, and recorded the longest common subsequence of the end position in the list
Date : 2025-07-02 Size : 517kb User : 滕海明
[Data structs] LCS DL : 0: VC实现输入两个字符串，利用动态规划思想求的最长公共子序列。有可视化界面。-VC the input two strings, the use of dynamic programming requirements of the longest common subsequence. A visual interface.
Date : 2025-07-02 Size : 3.61mb User :
[Data structs] LCS DL : 0: 最长公共子序列的算法实现。基于动态规划的丝线实现的算法-The longest common subsequence algorithm. Realization of the algorithm based on dynamic programming thread
Date : 2025-07-02 Size : 1kb User : achuan
[Other] dynamic-programming DL : 0: 《算法艺术与信息学竞赛》45道动态规划题目【POJ1141】括号序列【POJ1191】棋盘分割【SPOJ196】决斗【AOA】跳舞机【AOA】积木游戏【AOA】艺术馆的火灾【AOA】机器人的名字【UVa10559】方块消除【AOA】公路巡逻【POJ1074】并行期望值【AOA】高性能计算机【AOA】模板匹配【AOA】不可解码的编码【AOA】青蛙的烦恼【AOA】排列问题【AOA】最优排序二叉树【POJ1038】 Bugs公司【UVa10531】迷宫统计【AOA】贪吃的九头龙【AOA】快乐的蜜月【AOA】移动机器人【UVa10271】佳佳的筷子【AOA】偷懒的工人【AOA】铁路调度【POJ1691】平板涂色【POJ1947】道路重建【ZJUxxx】圆和多边形【AOA】铁球落地【UVA10118】免费糖果【AOA】丢三落四的老鼠【AOA】最长公共子序列问题【UVA10635】排列的LCS问题【UVAxxx】最长上升子序列问题【UVAxxx】最优二分检索树问题【POJ1180】任务调度问题【AOA】序列分割问题【AOA】多排列的LCS 【POJ1159】回文词【AOA】友好城市【POJ1160】邮局【AOA】基因串【POJ1946】奶牛转圈【AOA】元件折叠【AOA】 DNA序列【AOA】最优布车方案 -" Algorithmic art and information science competition" 45 dynamic programming problem
Date : 2025-07-02 Size : 145kb User : 贾诩

« 12 »