Location:
Search - lcs
Search list
Description: 用Java实现的LCS最大公共子序列算法，输入从文件中读取ASCII码-LCS common subsequence algorithm implemented in Java, the input is read from the file in ASCII
Platform: |
Size: 3072 |
Author: xiaotian |
Hits:
Description: 求最长公共子序列Seeking the longest common subsequence-Seeking the longest common subsequence LCS program
Platform: |
Size: 1688576 |
Author: yuanwenlong |
Hits:
Description: 利用lcs进行的两个字符串的最长公共子序列查找。-Longest common subsequence Find the use of two strings lcs.
Platform: |
Size: 322560 |
Author: 李嘉锋 |
Hits:
Description: LCS and tokenizer to find the longest sequence and make a sample word DB from articles.-LCS and tokenizer to find the longest sequence and make a sample word DB from articles.
Platform: |
Size: 3072 |
Author: Kaisar Ali |
Hits:
Description: 求解所有的最大公共子序列，用于比较两个各字符串-All of LCS
Platform: |
Size: 13312 |
Author: 吴江 |
Hits:
Description: LCS算法实现简单中文文本相似度分析-最大公共子串-The LCS algorithm to implement a simple text similarity analysis- the largest public substring
Platform: |
Size: 5120 |
Author: 李浩 |
Hits:
Description: 最长公共子序列算法LCS实现。任意输入两个字符串，通过此算法可以找到最长的公共子序列的长度，并且输出全部的最长公共子序列。-The longest common subsequence algorithm LCS. Any two input strings, this algorithm can be found in the length of the longest common subsequence, and output the longest common subsequence.
Platform: |
Size: 2048 |
Author: 枫轩缘 |
Hits:
Description: 最长公共子序列，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列。-The longest common subsequence, the English abbreviation for the LCS (Longest Common Subsequence). Which is defined as a sequence S, are two or more sub-sequence of a known sequence, and this condition is the longest sequence, then S is called a known sequence of the longest common subsequence.
Platform: |
Size: 297984 |
Author: 陆小果 |
Hits:
Description: 这是一个实现lcs算法问题的java代码，其中有比较简单的swing和AWT的使用，但是算法是成功的可以借鉴-This is a realization of java code lcs algorithm for the problem, which has a relatively simple swing and AWT use, but the algorithm can learn to be successful
Platform: |
Size: 4096 |
Author: 严琪 |
Hits:
Description: LCS 最长公共子序列。一个序列，如果是两个或多个已知序列的子序列，且是所有子序列中最长的，则为最长公共子序列。-LCS longest common subsequence. A sequence, if two or more sub-sequences of known sequences, and is the longest of all the sub-sequences, for the longest common subsequence.
Platform: |
Size: 6144 |
Author: jia |
Hits:
Description: 根据X和Y序列，利用动态规划计算出的所有LCS-The X and Y sequences is calculated using dynamic programming all LCS
Platform: |
Size: 1024 |
Author: shenjiayang |
Hits:
Description: LCS 最长公共子序列 C代码实现 随机生成小于等于n的自然数的一个序列，输出其最长递增子序列（任意一个即可）。-Longest Common Sequence realized by C
Platform: |
Size: 9413632 |
Author: liming |
Hits:
Description: lcs ,最长公共子序列，去两组字符中 LCS 最长公共子序列-lcs, longest common subsequence, to two characters in the longest common subsequence LCS
Platform: |
Size: 1024 |
Author: blue |
Hits:
Description: 基于C语言编程的最长公共子序列搜索（lcs）算法-Based on the C programming language longest common subsequence search (lcs) algorithm
Platform: |
Size: 1024 |
Author: 棠晓胜 |
Hits:
Description: 找出两个字符串的最长公共子序列，如有多个一并输出，并去掉重复的-find the LCS
Platform: |
Size: 2048 |
Author: 原巍春 |
Hits:
Description: 最长公共子序列的算法LCS：包括随机输入两个字符串，输出这两个字符串的最长公共子序列。-The longest common subsequence algorithm LCS: including random two input strings, the longest common subsequence outputs of the two string.
Platform: |
Size: 221184 |
Author: yang wen |
Hits:
Description: 用python实现了最长公共子序列LCS代码，分别应用递归方法和动态规划实现。并且实现了三个字符串的最长公共子序列。-Using Python to achieve the longest common subsequence of LCS code, respectively using recursive method and dynamic programming. And the realization of the longest common subsequence of three strings.
Platform: |
Size: 1024 |
Author: 王宝鑫 |
Hits:
Description: LCS 问题 最大公共子序列 LCS 问题 最大公共子序列-The biggest problem common subsequence LCS LCS LCS biggest problem common subsequence problem largest common subsequence
Platform: |
Size: 1024 |
Author: 石飞达 |
Hits:
Description: It enables users to input a time-series
of 2-D velocity field data (e.g., DPIV measurements or CFD calculations) and
compute the corresponding finite-time Lyapunov exponent (FTLE) fields, which
Lagrangian Coherent Structures (LCS) suchas vortices and fluid transport barriers
can be identified.- It enables users to input a time-series
of 2-D velocity field data (e.g., DPIV measurements or CFD calculations) and
compute the corresponding finite-time Lyapunov exponent (FTLE) fields, which
Lagrangian Coherent Structures (LCS) suchas vortices and fluid transport barriers
can be identified.
Platform: |
Size: 168960 |
Author: yuanke |
Hits:
Description: 用后缀自动机在线性时间复杂度下解决LCS问题-To calulate the LCS with SAM
Platform: |
Size: 1024 |
Author: ShinriiTin |
Hits: