# Longest common subsequence problem (Q141001)

the problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible
• Longest-common subsequence problem, LCS
Language Label Description Also known as
English
Longest common subsequence problem
the problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible
• Longest-common subsequence problem, LCS

## Statements

0 references
${\displaystyle O\left(2^{n_{1}}\sum _{i>1}n_{i}\right)}$
1 reference
0 references

1 reference
28 October 2013

• arwiki
• bewiki
• enwiki
• eowiki
• eswiki
• fawiki
• frwiki
• itwiki
• jawiki
• kowiki
• plwiki
• ruwiki
• srwiki
• tawiki
• zhwiki