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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2010

The longest common subsequence problem is classical string problem. It has applications, for example, in pattern recognition and…

2010

We address in this paper the design and analysis of cost-optimal parallel algorithms for solving the problem of the longest…

2009

Let X and Y be two finite strings over a finite alphabet Σ. A common subsequence of X and Y is a subsequence which is a…

2007

In order to find the longest common subsequence (LCS) as soon as possible, we, with the method of match pairs, propose the new…

2007

There are two general approaches to the longest common subsequence problem. The dynamic programming approach takes quadratic time…

2006

A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate…

1998

A longest common subsequence (LCS) of two strings is a common subsequence of the two strings of maximal length. The LCS problem…

1995

Given two sequences A = a1a2... am and B = b1b2... bn, m ≤ n, over some alphabet Σ of size s, the longest common subsequence…

1991

The longest common subsequence problem is to find a longest common subsequence of two given strings. The complexity of this…

1975