Search - subsequence

Search - subsequence - List

[Other] Dijkstra DL : 0: 求数组最长递增子序列算法。输入一个数组，输出其最大递增子序列-Array for the longest increasing subsequence algorithm. An array of input and output its maximum incremental sequence
Date : 2025-07-02 Size : 1kb User : sdf
[Software Engineering] LCS(c++) DL : 0: LCS Algorithm, this is a c++ code for lcs(Longest Common Subsequence)
Date : 2025-07-02 Size : 8kb User : 劉逸
[ActiveX/DCOM/ATL] lcs DL : 0: LCS Longest (maximum) common subsequence -LCS Longest (maximum) common subsequence
Date : 2025-07-02 Size : 1kb User : 鲁剑锋
[Algorithm] longest DL : 0: Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8). -Problem B: Longest Ordered SubsequenceA numeric sequence of ai is ordered if a1 <a2 <... <aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 <i2 <... <iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, eg, ( 1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, eg, (1, 3, 5, 8).
Date : 2025-07-02 Size : 1kb User : hzf
[Other] 1977+Algorithms+for+the+Longest+Common+Subsequence DL : 0: 最长子序列,英文版,电子书 ACM文章1977+Algorithms+for+the+Longest+Common+Subsequence+Problem-The longest sequence, in English, e-books ACM article 1977+ Algorithms+ For+ The+ Longest+ Common+ Subsequence+ Problem
Date : 2025-07-02 Size : 700kb User : 张启达
[Other] subsequence DL : 0: 最长子序列的求解,用于查找几个序列中最长的公共子序列，并且返回查找结果-it can be used to search a longest subsequence
Date : 2025-07-02 Size : 20kb User : kyle
[ActiveX/DCOM/ATL] lcs DL : 0: Longest Common Subsequence Problem. Solution both Iterative and Recursive.
Date : 2025-07-02 Size : 1kb User : gowdd
[ActiveX/DCOM/ATL] project1 DL : 0: Constrained LCS. Given two sequences X, Y and a constrained sequence P, a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest subsequence of X and Y such that P is a subsequence of Z.
Date : 2025-07-02 Size : 7kb User : Austin
[CSharp] LMIS DL : 0: 动态规划求解最长单调递增子序列，给出了图形界面-Dynamic programming to solve the longest monotonically increasing subsequence given the graphical user interface
Date : 2025-07-02 Size : 327kb User : ethene
[Other] xulie DL : 0: 利用动态规划法求解次最长公共子序列问题。-The use of dynamic programming method for solving second longest common subsequence problem.
Date : 2025-07-02 Size : 1.01mb User : hehuiling
[Documents] LSC(full) DL : 0: lcs 求出全部的最长公共子序列,实验程序全部采用Java实现，编译器为J2SE SDK 1.5.0_06，集成环境为Eclipse 3.1.2。-lcs find all of the longest common subsequence, experimental procedure used in all Java implementation, the compiler for the J2SE SDK 1.5.0_06, an integrated environment for Eclipse 3.1.2.
Date : 2025-07-02 Size : 5kb User : randoll
[matlab] Babu_N_Parallel_Algorithms_for_the_Longest_Common DL : 0: Parallel Algorithms for the Longest Common Subsequence Problem
Date : 2025-07-02 Size : 83kb User : naz
[Mathimatics-Numerical algorithms] LCS DL : 0: 在C++环境下开发的最长公共子序列算法，可以下下来试试看-In C++ development environment, the longest common subsequence algorithm can try the next down
Date : 2025-07-02 Size : 552kb User : Nango
[Data structs] longest_common_subsequence DL : 0: 求出所有最长公共子序列（连续序列）输入： malose malmose 输出： lcs_length=3 lcs_string=ose lcs_string=mal-ouput all the longest common subsequences. the subsequence must be series. for example: [input] malose malmose [output] lcs_length=3 lcs_string=ose lcs_string=mal
Date : 2025-07-02 Size : 1kb User : ocree
[Data structs] subsequence DL : 0: 这是用c 写的关于最长公共子序列的一个算法，是学习算法分析与设计时做的一个实验，希望对初学者有用呵（原来的名字是“最长公共子序列”，因为上传的原因改成现在的名字）-This is c written about one of the longest common subsequence algorithm, learning algorithm is to do analysis and design an experiment, I hope useful for beginners O (the original name is " the longest common subsequence" , because uploading The reason for the name change now)
Date : 2025-07-02 Size : 102kb User : 楚明阳
[Data structs] most-common-subsequence-string DL : 0: 算法设计类源码。使用动态规划的方式计算两个字符串的最大公共子序列。-Algorithm design class source code. Calculated using dynamic programming the two most common subsequence string.
Date : 2025-07-02 Size : 2kb User : lixu
[Data structs] Dynamic-Programming DL : 0: 这是算法设计与分析课程实验，动态规划的源程序。包含最长上升子序列，最长公共子序列，最大字段和问题，DP背包问题-This is a test algorithm design and analysis programs, dynamic programming source code. Rising sequence containing the longest, longest common subsequence, maximum field and problems, DP knapsack problem
Date : 2025-07-02 Size : 2kb User : 林达
[JSP/Java] LIS(Longest-increasing-subsequence) DL : 0: 最长非降单调子列的实现。java写成。谢谢。-Longest increasing subsequence
Date : 2025-07-02 Size : 9kb User : Jackie_09
[Data structs] longest-substring DL : 0: 最长公共子序列递归算法，最长限制是10000字符-Longest common subsequence of a recursive algorithm, the maximum limit is 10,000 characters
Date : 2025-07-02 Size : 2kb User : zibin_lee
[Data structs] The--longest-common-subsequence DL : 0: 本代码是算法设计中的最长公共子序列问题，通过C++编写。-This code is the longest common subsequence algorithm design, written by C++.
Date : 2025-07-02 Size : 1kb User : 随波

« 12 3 4 5 6 7 8 9 10 ... 14 »