Search - lcs - CodeBus

Search - lcs - List

[Mathimatics-Numerical algorithms] 1159_Palin DL : 0: poj 第1159题palin_drome_回文最长公共子序列 LCS DP 滚动数组-poj 1159 title palin_drome_ palindrome longest common subsequence LCS DP rolling array
Date : 2025-07-02 Size : 1kb User : ni
[Technology Management] lcs1.c DL : 0: This a implementation of LCS in C-This is a implementation of LCS in C
Date : 2025-07-02 Size : 1kb User : Siki
[Other] LCD DL : 0: Driving LCS COG 128x 64
Date : 2025-07-02 Size : 3kb User : Durgesh
[Other] LCS DL : 0: 随机生成小于等于n的自然数的一个序列，输出其最长递增子序列-N or less randomly generated a sequence of natural numbers, the output of its longest increasing subsequence
Date : 2025-07-02 Size : 1kb User : jack
[Data structs] LCSProblem DL : 0: LCS算法: 通常两个字符串的最大公共子串的问题是通过下面的算法来完成的：把字符串1（长度m）横排，串2（长度n）竖排，得到一个m×n的矩阵c，矩阵的每个元素的值如下，如果m[i]=n[j]，则c[j][i]=1,否则，c[j][i]=0。然后找出矩阵中连续是1的对角线最长的一个，则对角线的长度就是公共子串的长度.-LCS algorithm: often the two most common sub-string string problem is through the following algorithm to accomplish: the string 1 (length m) horizontal, series 2 (length n) vertical, get an m × n of matrix c, the value of each element matrix is as follows, if m [i] = n [j], then c [j] [i] = 1, otherwise, c [j] [i] = 0. Then find the matrix is a continuous one of the longest diagonal, then the diagonal length of the substring is the length of the public.
Date : 2025-07-02 Size : 2kb User : sdf
[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
[Embeded-SCM Develop] Nokia-LCDs---Proteus-VSM-Models DL : 0: this files are NOKIA LCS Proteus models. Enjoy it!!!
Date : 2025-07-02 Size : 304kb User : douglas_ia
[Data structs] 3.1 DL : 0: 最长公共子序列问题最长公共子序列（动态规划）实验数据：input.txt X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A} ——要求给出X、Y的最长公共子序列Z，程序运行结束时，将计算结果输出到文件output.txt中。输出文件中包含问题的答案：找不到公共子序列时给出“null” 。 -Longest common subsequence problem LCS (dynamic programming) experimental data: input.txt X = {A, B, C, B, D, A, B} Y = {B, D, C, A, B, A}- required to give X, Y of the longest common subsequence Z, the end run, will result in the output to the file output.txt. Output file contains the answer to the question: can not find the common sub-sequence gives " null" .
Date : 2025-07-02 Size : 99kb User : 陈星风
[JSP/Java] LCS DL : 0: 求两个字符串的最大公共子串的问题，用矩阵法得到复杂度O(M*N)-Find the two largest public string substring problem obtained with the matrix complexity O (M* N)
Date : 2025-07-02 Size : 1kb User : qin
[Windows Develop] the-longest-pubilc-sequence DL : 0: 最长公共子序列-LCS
Date : 2025-07-02 Size : 784kb User : yanzi
[Data structs] LCS DL : 0: 用C++实现最长公共子序列算法的程序清单-Using C++, the longest common subsequence algorithms Listing
Date : 2025-07-02 Size : 9kb User : Dragonal1
[matlab] asymppdc DL : 0: 这是第一版的AsymPDC工具包。用来处理PDC，gPDC和iPDC有关内容。运行环境为Matlab,并且要求至少Matlab中预装了3个工具箱：控制系统，信号处理和统计工具箱。-This is the first public release of AsympPDC package. It deals with the asymptotic statistics for PDC, gPDC and iPDC. AsympPDC runs under Matlab and is a practically self-contained except for requires routines from three Matlab toolboxes: Control System, Signal Processing, and Statistical. It is not extensively tested yet. It was partially tested under Windows, Macintosh and Linux environments with Matlab version 7.0 and higher. Please report any incompatibility to ksameshi[at]usp.br or baccala[at]lcs.poli.usp.br. Additionally for cosmetic purposes, the pdc_xplot routine uses several Matlab users contributed codes: subplot2.m (modified old version of supbplot to control spacing between subplots), shadedplot.m (developed by Dave Van Tol), suplabel.m (for label and title plotting in subplot figures, by Ben Barrowes), suptitle.m (contributed by Drea Thomas, for adding title above all subplots), and tilefigs.m (for tiling figures for simultaneous visualization, by Charles Plum)
Date : 2025-07-02 Size : 590kb User : 罗巍巍
[Industry research] pbl-of-lcs DL : 0: PBL of linear control systems
Date : 2025-07-02 Size : 11kb User : harsimran
[Software Engineering] pbls-of-LCS-previous DL : 0: PROJECT BASED learning for linear control system
Date : 2025-07-02 Size : 9kb User : harsimran
[Software Engineering] Question-Bank DL : 0: Question bank for LCS
Date : 2025-07-02 Size : 85kb User : harsimran
[Data structs] LCS DL : 0: 给定2个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。你的任务是：给定2个序列X、Y，求X和Y的最长公共子序列Z -Given two sequences X and Y, when another sequence Z is X, Y sequence is sub-sequence, said sequence of X and Y Z is the common sub-sequences. Your task is: given two sequences X, Y, X and Y find the longest common subsequence Z
Date : 2025-07-02 Size : 632kb User : 张西
[Data structs] LCS DL : 0: 最长公共子序列，并且实现了输出。好的不得了。不要错过啊！-Longest common subsequence, and to achieve the output. Extremely good. Do not miss ah!
Date : 2025-07-02 Size : 573kb User : 尚启昌
[Data structs] LCS DL : 0: 最长公共子序列问题求解
Date : 2025-07-02 Size : 192kb User : wangh
[Data structs] LCS DL : 0: the longest common serials
Date : 2025-07-02 Size : 1kb User : newman97
[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 :

« 1 2 3 4 5 6 7 89 10 11 »