搜索资源列表
LCS
- 本人的写的第一个局域网中的聊天室,用的MFC框架,适用新手-I write the first LAN chat room with the MFC framework, the application of new
lcs
- local contrast equalization.
nLCS
- 新版本的LCS,增加了一些删除功能。为了下载啦。-A new version of the LCS, the deletion of a number of features increased.
LCS
- longest common subsequence implementation
LCS
- long comman subsequence directory program for the beginner
L_C_S
- This program finds Least Common Divisor (LCS) of two or more numbers.
ACM_fuction
- acm 常用函数,如数学问题,高精度算法,快速傅里叶算法,字符串问题,LCS,几何问题,图论,Dijkstra,Prim,Floyd,数论,素数筛选等-fuctions of acm
LCS
- 求最长公共子系列,即给出两序列,求得相同的序列-Seeking the longest common sub-series, that is, given two sequences, obtained the same sequence of
ethernet_tri_mode_latest.tar
- 10_100 0 Mbps tri-mode ethernet MAC implements a MAC controller conforming to IEEE 802.3 specification. It is designed to use less than 2000 LCs/LEs to implement full function. It will use inferred RAMs and PADs to reduce technology dependance.
ALL_LCS
- LCS(最长公共子序列)能够输出所有的最长公共子序列-LCS (longest common subsequence) to output all of the longest common subsequence
3
- 采用动态规划算法求最长公共串,LCS算法经典中的经典-A dynamic programming algorithm seeking longest common string
lis_lds02
- A N*log(N) algorithm implementation of classic LCS problem. Very detail for reading and understanding. Hope this help people learning.
LCSAlgo
- 1.此程式執行將從路徑讀取二個文字檔 ( 路徑:C:/INPUT1.TXT, C:/INPUT2.TXT ) 2.執行結束會產生一個最佳解的文字檔 ( 路徑:C:OUTPUT.TXT )並說明最佳解的長度及跳躍次數首先動態宣告了temp陣列來存取input的內容大小依照文章的長度而定並分別記錄兩個input的文章大小給定兩 序列 ,最長共同子序列 (LCS)問題是決定一個子序列 :使得該子序列 是這兩 序ɿ
Longgest
- 找两个字符串中最长最序列的代码,自己编写的,算法思想参考的算法导论中的LCS算法。能成功运行。 c语言编写-C code.also called LCS
LCS
- 算法设计与分析课程中用动态规划算法求解最长公共子序列问题,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 ar
1159_Palin
- poj 第1159题palin_drome_回文 最长公共子序列 LCS DP 滚动数组-poj 1159 title palin_drome_ palindrome longest common subsequence LCS DP rolling array
lcs1.c
- This a implementation of LCS in C-This is a implementation of LCS in C
LCD
- Driving LCS COG 128x 64
LCS
- 随机生成小于等于n的自然数的一个序列,输出其最长递增子序列-N or less randomly generated a sequence of natural numbers, the output of its longest increasing subsequence
LCSProblem
- 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 fol