搜索资源列表
1
- 给定2个序列X={x1,x2,…,xm}和Y={y1,y2,…,yn}，找出X和Y的最长公共子序列。-Given two sequences X = {x1, x2, ..., xm} and Y = {y1, y2, ..., yn}, X and Y to find the longest common subsequence.
long
- 最长公共子序列的JAVA实现，直接复制粘贴即可运行-Longest common subsequence of JAVA implementation, you can directly copy and paste operation
LCS
- longest common subsequence
LCS
- longest common subsequence using dynammic programmin
algorithm
- 一些经典算法的java实现：包括：二分查找，最优二搜索树，编辑距离，哈夫曼树，最长公共子序列，矩阵连乘问题，最短路径优先-Some classic algorithm java implementation: including: binary search, and optimal two search tree, the edit distance Huffman tree, the longest common subsequence matrix multiplicative Short
lcs
- 随机生成两个长度为1000的字母序列，利用动态规划算法实现求最长公共子序列，并输出最长公共子序列的长度，一般是320左右。-Two randomly generated sequence of letters of length 1000, the use of dynamic programming algorithm for the longest common subsequence, and the output length of the longest common subseque
lcs
- 在一组序列中，找到最长公共子序列，虽然序列不是唯一的，但是是根据最长公共子序列的长度来确定。-In the Java code to achieve the longest common subsequence, and algorithm of the ideology of the book