搜索资源列表
lcs
- 算法导论中最长公共子序列的实现，采用动态规划方法-Introduction to Algorithms in the realization of the longest common subsequence, dynamic programming method
Nokia-LCDs---Proteus-VSM-Models
- this files are NOKIA LCS Proteus models. Enjoy it!!!
3.1
- 最长公共子序列问题 最长公共子序列（动态规划） 实验数据：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:
LCS
- 求两个字符串的最大公共子串的问题，用矩阵法得到复杂度O(M*N)-Find the two largest public string substring problem obtained with the matrix complexity O (M* N)
the-longest-pubilc-sequence
- 最长公共子序列-LCS
LCS
- 用C++实现最长公共子序列算法的程序清单-Using C++, the longest common subsequence algorithms Listing
asymppdc
- 这是第一版的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 pra
pbl-of-lcs
- PBL of linear control systems
pbls-of-LCS-previous
- PROJECT BASED learning for linear control system
Question-Bank
- Question bank for LCS
LCS
- 给定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
LCS
- 最长公共子序列，并且实现了输出。 好的不得了。不要错过啊！-Longest common subsequence, and to achieve the output. Extremely good. Do not miss ah!
LCS
- 最长公共子序列问题求解
LCS
- the longest common serials
LCS
- VC实现输入两个字符串，利用动态规划思想求的最长公共子序列。有可视化界面。-VC the input two strings, the use of dynamic programming requirements of the longest common subsequence. A visual interface.
lcs
- Local contrast stretching
LCS
- 采用递归的方式，找出两个字符串序列的所有最长公共子序列-Identify all the longest common subsequence of two strings of sequence
cellbuzz-rc5-2.0.tar
- 用于蜂窝宽带的流和文件的RC5加密程序.包含数字签名,消息加扰等功能.-RC5 is a block cipher that was originally designed by Ronald Rivest (http://theory.lcs.mit.edu/~cis/pubs/rivest/rc5.ps). We have implemented and optimized the RC5 encryption/decryption library for the Sony-Toshiba-
LCS
- longest common subsequence
LCS
- 最长公共子序列的算法实现。基于动态规划的丝线实现的算法-The longest common subsequence algorithm. Realization of the algorithm based on dynamic programming thread