Longest common subsequence problem

Known as: LCS problem, Longest-common subsequence problem, Difference Algorithm 
The longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences (often… (More)
Wikipedia

Related topics

Related topics

24 relations
BacktrackingBioinformaticsChecksumChvátal–Sankoff constants
(More)

Broader (1)

Dynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A hyper-heuristic for the Longest Common Subsequence problem
The Longest Common Subsequence Problem is the problem of finding a longest string that is a subsequence of every member of a… (More)
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • table 3
Is this relevant?
2011
2011
The Longest Common Subsequence Problem for Arc-Annotated Sequences
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The longest arc… (More)
Is this relevant?
2008
2008
Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as a subsequence… (More)
Is this relevant?
2007
2007
Dynamic programming algorithms for the mosaic longest common subsequence problem
The longest common subsequence (LCS) problem can be used to measure the relationship between sequences. In general, the inputs of… (More)
  • figure 1
Is this relevant?
2007
2007
A New Algorithm for the Longest Common Subsequence Problem
In order to find the longest common subsequence (LCS) as soon as possible, we, with the method of match pairs, propose the new… (More)
  • table 1
  • table 2
Is this relevant?
1997
1997
Parallel algorithms for the longest common subsequence problem
The longest common subsequence problem is to find a substring that is common to two given strings and is atleast as long as any… (More)
  • figure 1
Is this relevant?
1994
1994
New Algorithms for the Longest Common Subsequence Problem
Given two sequences A = a 1 a 2 : : :a m and B = b 1 b 2 : : :b n , m n, over some alphabet , a common subsequence C = c 1 c 2… (More)
Is this relevant?
1992
1992
Matrix Longest Common Subsequence Problem, Duality and Hibert Bases
Although a number of efficient algorithms for the longest common subsequence (LCS) problem have been suggested since the 1970's… (More)
Is this relevant?
1980
1980
A fast algorithm for the longest-common-subsequence problem
In this paper, a fast algorithm for the longest-common-subsequence problem is prtsented which runs in O(@ + n)logn), time where p… (More)
  • figure 1
Is this relevant?
1976
1976
Bounds on the Complexity of the Longest Common Subsequence Problem
The problem of finding a longest common subsequence of two strings is discussed. This problem arises in data processing… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?