# 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

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
• Computational Biology and Chemistry
• 2012
The Longest Common Subsequence Problem is the problem of finding a longest string that is a subsequence of every member of aâ€¦Â (More)
Is this relevant?
2011
2011
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The longest arcâ€¦Â (More)
Is this relevant?
2008
2008
• Algorithmica
• 2008
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
• Inf. Process. Lett.
• 2007
The longest common subsequence (LCS) problem can be used to measure the relationship between sequences. In general, the inputs ofâ€¦Â (More)
Is this relevant?
2007
2007
• International Conference on Computationalâ€¦
• 2007
In order to find the longest common subsequence (LCS) as soon as possible, we, with the method of match pairs, propose the newâ€¦Â (More)
Is this relevant?
1997
1997
• HiPC
• 1997
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)
Is this relevant?
1994
1994
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
• CPM
• 1992
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
In this paper, a fast algorithm for the longest-common-subsequence problem is prtsented which runs in O(@ + n)logn), time where pâ€¦Â (More)
Is this relevant?
1976
1976
• J. ACM
• 1976
The problem of finding a longest common subsequence of two strings is discussed. This problem arises in data processingâ€¦Â (More)
Is this relevant?