CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - longest
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Compress-Decompress algrithms
STL
Data structs
Algorithm
AI-NN-PR
matlab
Bio-Recognize
Crypt_Decrypt algrithms
mathematica
Maple
DataMining
Big Data
comsol
physical calculation
chemical calculation
simulation modeling
Search - longest - List
[
Data structs
]
最长公共子串问题
DL : 0
最长公共子串问题-longest public substrings problems
Date
: 2025-12-26
Size
: 7kb
User
:
邢刚
[
Data structs
]
[转载]nlogn的最长子序列算法
DL : 0
关于用nlogn的最长子序列算法,在网上摘录的-discusses the use of the longest sequences algorithm, in the extract from the Internet
Date
: 2025-12-26
Size
: 1kb
User
:
关安
[
Data structs
]
公共子序列
DL : 1
本算法实现的是对两个单字符串的扫描,找出其最长公共子序列。-the algorithm to achieve the two-string scan, identify its longest public sequences.
Date
: 2025-12-26
Size
: 1kb
User
:
汪永威
[
Data structs
]
LCS_Dynamic_Programming
DL : 0
LCS(最长公共子序列)问题可以简单地描述如下: 一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y,当另一序列Z既是X的子序列又是Y的子序列时,称Z是序列X和Y的公共子序列。例如,若X={A,B,C,B,D,B,A},Y={B,D,C,A,B,A},则序列{B,C,A}是X和Y的一个公共子序列,但它不是X和Y的一个最长公共子序列。序列{B,C,B,A}也是X和Y的一个公共子序列,它的长度为4,而且它是X和Y的一个最长公共子序列,因为X和Y没有长度大于4的公共子序列。 最长公共子序列问题就是给定两个序列X={x1,x2,...xm}和Y={y1,y2,...yn},找出X和Y的一个最长公共子序列。对于这个问题比较容易想到的算法是穷举,对X的所有子序列,检查它是否也是Y的子序列,从而确定它是否为X和Y的公共子序列,并且在检查过程中记录最长的公共子序列。X的所有子序列都检查过后即可求出X和Y的最长公共子序列。X的每个子序列相应于下标集{1,2,...,m}的一个子集。因此,共有2^m个不同子序列,从而穷举搜索法需要指数时间。 -LCS (longest public sequences) can be simply described as follows : given a sequence of sequences in the sequence is deleted after some element of the sequence. Given two sequences X and Y, Z is another sequence of the X-Y sequence is the sequences, Z is said X and Y series of public sequences. For example, if X = (A, B, C, B, D, B, A), (Y = B, D, C, A, B, A), the sequence (B, C, A) X and Y is a public sequences, it is not X and Y in a public longest sequences. Sequence (B, C, B, A) X and Y is a public sequences, and its length is 4. but it is the X and Y for a public longest sequence, X and Y because no greater than the length of the four sequences in public. The longest public sequences problem is given two sequences X = (x1, x2, ...) xm and Y = (y1, y2, ... yn), to identify X and Y in a
Date
: 2025-12-26
Size
: 4kb
User
:
汤烈
[
Data structs
]
longest-common-string
DL : 0
这是动态规划中,求最长公共子序列(Longest common string)的源代码。自己编写执行。程序简单,有注释。-This is a dynamic planning, seeking the longest common sub-sequence (Longest common string) the source code. The preparation of the implementation of their own. Procedure is simple, there are notes.
Date
: 2025-12-26
Size
: 211kb
User
:
haha
[
Data structs
]
LCS
DL : 0
使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进-The use of dynamic programming methods, to achieve the longest common sub-sequence algorithms, and dynamic programming methods of time and space to improve
Date
: 2025-12-26
Size
: 263kb
User
:
小波
[
Data structs
]
longest
DL : 0
给出一个由非0整数组成的序列a1,a2,…,an, 设计递归算法求其中由同号整数组成的最长连续段(称为最长同号连续段)的长度。-Given a non-0 component of the sequence of integers a1, a2, ..., an, the design of recursive algorithm for one by the same integer number consisting of the longest continuous segment (known as the longest consecutive number with the above) in length.
Date
: 2025-12-26
Size
: 215kb
User
:
wu
[
Data structs
]
DP
DL : 0
最长路径DP算法 根据邻近矩阵,再运用DP算法计算出图中任意节点间的最长路径,有点类似于最短路径算法-DP algorithm for the longest path in accordance with the neighboring matrix, re-use of DP algorithm to calculate arbitrary graph the longest path between nodes, somewhat similar to the shortest path algorithm
Date
: 2025-12-26
Size
: 2kb
User
:
yuxiqian
[
Data structs
]
longest
DL : 0
这是暑假写的最长公共子序列算法,呵呵, 欢迎大家来下载-Writing This is the longest summer vacation of public sequence algorithm, huh, huh, welcome everyone to download
Date
: 2025-12-26
Size
: 168kb
User
:
zuoxue
[
Data structs
]
longest
DL : 0
算法分析中动态规划法的经典例子,最长公子序列问题。VC++编写的C源码-Algorithm analysis, a classic example of dynamic programming, the longest sequence of the problem son. VC++ source code written in C
Date
: 2025-12-26
Size
: 162kb
User
:
感飞
[
Data structs
]
LongestIncSubSeq
DL : 0
求最长单调递增子序列。举例:原数组:1 5 1 3 1 56 21 6 86 2 1 6 5 22 1 5 9 62 1 3 56 31 1 56 3 1 1 66 3 1 6 6 3 1 6 6 1 结果: the longest monotonically increasing sub-sequence: Length: 14 Content:-Seeking the longest monotonically increasing subsequence. For example: The original array: 1 5 1,315,621,686,216,522,159 62 1 3 5,631,156,311,663,166,316 6 1 Results: the longest monotonically increasing sub- sequence: Length: 14 Content: 1 1 1 1 1 1 1 1 1 1 6 6 6 6
Date
: 2025-12-26
Size
: 51kb
User
:
陈晨
[
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-12-26
Size
: 1kb
User
:
ocree
[
Data structs
]
longest
DL : 0
从一个不超过80个字符的句子中找出一个句子中长度最长的单词-find the longest word of a sentence,which contains less than 80 words
Date
: 2025-12-26
Size
: 2kb
User
:
chenquan
[
Data structs
]
longest-substring
DL : 0
最长公共子序列递归算法,最长限制是10000字符-Longest common subsequence of a recursive algorithm, the maximum limit is 10,000 characters
Date
: 2025-12-26
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-12-26
Size
: 1kb
User
:
随波
[
Data structs
]
The-longest-common-subsequence
DL : 0
运用动态规划思想和策略,解决最长公共子序列问题。-The use of dynamic programming ideas and strategies to solve the longest common subsequence problem.
Date
: 2025-12-26
Size
: 1kb
User
:
吕子乔
[
Data structs
]
3-1-Longest-Increasing-Subsequence
DL : 0
3-1 Longest Increasing Subsequence
Date
: 2025-12-26
Size
: 1kb
User
:
henry
[
Data structs
]
longest-increasing-subsequence
DL : 0
数据结构 动态规划算法 最长递增子序列的C语言代码-Data structures dynamic programming algorithm longest increasing subsequence of C language code
Date
: 2025-12-26
Size
: 1kb
User
:
杰
[
Data structs
]
Longest-Palindromic-Substring
DL : 0
这是一个求最长回纹序列的c++算法,简单易懂,感兴趣的可以-This is a request fret longest sequence c++ algorithm, easy to understand, are interested can look at
Date
: 2025-12-26
Size
: 4.67mb
User
:
曹本
[
Data structs
]
Longest common subsequence
DL : 0
用动态规划思想设计实现最长公共子序列问题,用贪心思想设计实现活动安排问题,并且用不同数据量进行对比分析。(We use dynamic programming theory to design the longest common subsequence problem. We use greedy thought to design the activity scheduling problem, and compare it with different data volume.)
Date
: 2025-12-26
Size
: 1kb
User
:
lcy2074
«
1
2
3
4
5
6
7
8
9
10
»
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.