Longest common subsequence
id:
longest-common-subsequence-244-1841847
title:
Longest common subsequence
text:
A longest common subsequence (LCS) is the longest subsequence common to all sequences in a set of sequences. It differs from the longest common substring: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The problem of computing longest common subsequences is a classic computer science problem, the basis of data comparison programs such as the diff utility, and has applications in computational linguistics and bioinformatics. It is a
brand slug:
wiki
category slug:
encyclopedia
description:
Algorithmic problem on pairs of sequences
original url:
https://en.wikipedia.org/wiki/Longest_common_subsequence
date created:
date modified:
2023-12-28T16:43:03Z
main entity:
{"identifier":"Q141001","url":"https://www.wikidata.org/entity/Q141001"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/25/Nubio_Diff_Screenshot3.png","width":398,"height":199}
fields total:
13
integrity:
15