Results 1  10
of
11,085
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
Longest Common Subsequence Problem
"... Longest common subsequence problem for unoriented and cyclic ..."
On the Longest Common Subsequence Problem
"... In this paper we consider an approach to solve the longest common subsequence problem. This approach is based on constructing logical models for the problem. ..."
Abstract

Cited by 16 (16 self)
 Add to MetaCart
In this paper we consider an approach to solve the longest common subsequence problem. This approach is based on constructing logical models for the problem.
Common Subsequence Automaton
, 2002
"... Given a set of strings, a common subsequence of this set is a string that is a subsequence of each string in this set. We describe an online algorithm building the nite automaton which accepts all common subsequences of the given set of strings. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Given a set of strings, a common subsequence of this set is a string that is a subsequence of each string in this set. We describe an online algorithm building the nite automaton which accepts all common subsequences of the given set of strings.
Longest Common Subsequences
 In Proc. of 19th MFCS, number 841 in LNCS
, 1994
"... . The length of a longest common subsequence (LLCS) of two or more strings is a useful measure of their similarity. The LLCS of a pair of strings is related to the `edit distance', or number of mutations /errors/editing steps required in passing from one string to the other. In this talk, we ex ..."
Abstract

Cited by 38 (1 self)
 Add to MetaCart
. The length of a longest common subsequence (LLCS) of two or more strings is a useful measure of their similarity. The LLCS of a pair of strings is related to the `edit distance', or number of mutations /errors/editing steps required in passing from one string to the other. In this talk, we
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
Length of Maximal Common Subsequences
, 1992
"... The problem of computing the length of the maximal common subsequences of two strings is quite well examined in the sequential case. There are many variations, but the standard approach is to compute the length in quadratic time using dynamic programming. A lineartime parallel algorithm can be obtai ..."
Abstract
 Add to MetaCart
The problem of computing the length of the maximal common subsequences of two strings is quite well examined in the sequential case. There are many variations, but the standard approach is to compute the length in quadratic time using dynamic programming. A lineartime parallel algorithm can
Hardness of longest common subsequence for . . .
 23RD ANNUAL SYMPOSIUM ON COMBINATORIAL PATTERN MATCHING (CPM'12), HELSINKI: FINLAND
, 2012
"... The longest common subsequence (LCS) problem is a classic and wellstudied problem in computer science with extensive applications in diverse areas ranging from spelling error corrections to molecular biology. This paper focuses on LCS for fixed alphabet size and fixed runlengths (i.e., maximum nu ..."
Abstract
 Add to MetaCart
The longest common subsequence (LCS) problem is a classic and wellstudied problem in computer science with extensive applications in diverse areas ranging from spelling error corrections to molecular biology. This paper focuses on LCS for fixed alphabet size and fixed runlengths (i.e., maximum
common subsequence problem
, 2006
"... The longest common subsequence (LCS) problem can be used to measure the relationship between sequences. In general, the inputs of the LCS problem are two sequences. For finding the relationship between one sequence and a set of sequences, we cannot apply the traditional LCS algorithms immediately. I ..."
Abstract
 Add to MetaCart
The longest common subsequence (LCS) problem can be used to measure the relationship between sequences. In general, the inputs of the LCS problem are two sequences. For finding the relationship between one sequence and a set of sequences, we cannot apply the traditional LCS algorithms immediately
Results 1  10
of
11,085