Results 1  10
of
1,078
Algorithms for the Hybrid Constrained Longest Common Subsequence Problem
 THE 27TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
"... We investigate a variant of the longest common subsequence problem. Given two sequences X, Y and two constrained patterns P, Q of lengths m, n, p, and q, respectively, the hybrid constrained longest common subsequence problem is to find a longest common subsequence of X and Y such that the resulting ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We investigate a variant of the longest common subsequence problem. Given two sequences X, Y and two constrained patterns P, Q of lengths m, n, p, and q, respectively, the hybrid constrained longest common subsequence problem is to find a longest common subsequence of X and Y
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.
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
CONSTRAINED LONGEST COMMON SUBSEQUENCE COMPUTING ALGORITHMS IN PRACTICE
"... Abstract. The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longest subsequence C of A and B such that P is a subsequence of C. There are several algorithms solving the CLCS ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longest subsequence C of A and B such that P is a subsequence of C. There are several algorithms solving the CLCS
Fast Algorithm for Constrained Longest Common Subsequence Problem
 Theoretical and Applied Informatics
"... The problem of finding the constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. The best known algorithms for its solving requires time of order of a product of the sequences length. We introduce a novel approach in which tim ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The problem of finding the constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. The best known algorithms for its solving requires time of order of a product of the sequences length. We introduce a novel approach in which
Algorithms for computing variants of the longest common subsequence problem
 In ISAAC
, 2006
"... Abstract. The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence analysis, and has applications to genetics and molecular biology. In this paper we define new variants, introducin ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
Abstract. The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence analysis, and has applications to genetics and molecular biology. In this paper we define new variants
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
Results 1  10
of
1,078