Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01681916n
Noun Concept
Categories: Problems on strings, Polynomial-time problems, Dynamic programming, NP-complete problems, All articles needing additional references
EN
longest common subsequence  longest common subsequence problem  Longest-common subsequence problem, LCS  Difference Algorithm  LCS
EN
A longest common subsequence is the longest subsequence common to all sequences in a set of sequences. Wikipedia
Definitions
Relations
Sources
EN
A longest common subsequence is the longest subsequence common to all sequences in a set of sequences. Wikipedia
The problem of finding a sequence that is a subsequence of each of a given set of sequences and is as long as possible Wikidata
IS A
computational problem
DIFFERENT FROM
longest common substring
Wikipedia
EN
longest common subsequence
Wikidata
EN
longest common subsequence problem
Wikipedia Redirections
EN
Difference Algorithm, LCS problem, Longest-common-subsequence problem, Longest-common subsequence problem, longest common subsequence problem
Wikidata Alias
EN
LCS, Longest-common subsequence problem, LCS, longest-common subsequence problem, LCS

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License