Results 1  10
of
766,973
Algorithms for the longest common subsequence problem
 J. ACM
, 1977
"... AaS~ACT Two algorithms are presented that solve the longest common subsequence problem The first algorithm is applicable in the general case and requires O(pn + n log n) time where p is the length of the longest common subsequence The second algorithm requires time bounded by O(p(m + 1 p)log n) In ..."
Abstract

Cited by 218 (2 self)
 Add to MetaCart
AaS~ACT Two algorithms are presented that solve the longest common subsequence problem The first algorithm is applicable in the general case and requires O(pn + n log n) time where p is the length of the longest common subsequence The second algorithm requires time bounded by O(p(m + 1 p)log n
On The Longest Common Subsequence Problem  General And Variants
, 2006
"... Let X and Y be any two sequences over an alphabet Σ, where each pair of elements in Σ is comparable. The longest common increasing subsequence(LCIS) problem is to find an increasing subsequence S common to both X and Y of greatest length. For any two sequences X and Y over an alphabet Σ, the longest ..."
Abstract
 Add to MetaCart
be strictly increasing, which need not be the case for LCS. Let X, Y and P be any three sequences over an alphabet Σ. The constrained longest common subsequence(CLCS) problem of X and Y with respect to P is to find a longest common subsequence S of X and Y, such that P is a subsequence of S.
Minimal Height and Sequence Constrained Longest Increasing Subsequence
"... Given a string S = a1a2a3 · · · an, the longest increasing subsequence (LIS) problem is to find a subsequence of S such that the subsequence is increasing and its length is maximal. In this paper, we propose and solve two variants of the LIS problem. The first one is the minimal height LIS where t ..."
Abstract
 Add to MetaCart
Given a string S = a1a2a3 · · · an, the longest increasing subsequence (LIS) problem is to find a subsequence of S such that the subsequence is increasing and its length is maximal. In this paper, we propose and solve two variants of the LIS problem. The first one is the minimal height LIS where
Minimum Height and Sequence Constrained Longest Increasing Subsequence
"... Given a string S = a 1a 2a 3...a n, the longest increasing subsequence (LIS) problem is to find a subsequence of S such that the subsequence is increasing and its length is maximum. In this paper, we propose and solve two variants of the LIS problem. The first one is the minimum height LIS where the ..."
Abstract
 Add to MetaCart
Given a string S = a 1a 2a 3...a n, the longest increasing subsequence (LIS) problem is to find a subsequence of S such that the subsequence is increasing and its length is maximum. In this paper, we propose and solve two variants of the LIS problem. The first one is the minimum height LIS where
Exemplar longest common subsequence
 In Proceedings of ICCS
, 2006
"... In this paper, we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest Common Subsequence problem, where the input sequences are over the union of two disjoint sets of symbols, a se ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
In this paper, we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest Common Subsequence problem, where the input sequences are over the union of two disjoint sets of symbols, a
Longest Common Subsequence Problem
"... Longest common subsequence problem for unoriented and cyclic ..."
On the Longest Common Parameterized Subsequence
"... The wellknown problem of the longest common subsequence (LCS), of two strings of lengths n and m respectively, is O(nm)time solvable and is a classical distance measure for strings. Another wellstudied string comparison measure is that of parameterized matching, where two equallength strings are ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The wellknown problem of the longest common subsequence (LCS), of two strings of lengths n and m respectively, is O(nm)time solvable and is a classical distance measure for strings. Another wellstudied string comparison measure is that of parameterized matching, where two equallength strings
Algorithms for the constrained longest common subsequence problems
 J. Found. Comput. Sci
, 2005
"... Abstract. Given strings S1,S2, and P, the constrained longest common subsequence problem for S1 and S2 with respect to P is to find a longest common subsequence lcs of S1 and S2 such that P is a subsequence of this lcs. We present an algorithm which improves the time complexity of the problem from t ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Abstract. Given strings S1,S2, and P, the constrained longest common subsequence problem for S1 and S2 with respect to P is to find a longest common subsequence lcs of S1 and S2 such that P is a subsequence of this lcs. We present an algorithm which improves the time complexity of the problem from
Results 1  10
of
766,973