Shortest common supersequence
id:
shortest-common-supersequence-237-12309630
title:
Shortest common supersequence
text:
In computer science, the shortest common supersequence of two sequences X and Y is the shortest sequence which has X and Y as subsequences. This is a problem closely related to the longest common subsequence problem. Given two sequences X = < x1,...,xm > and Y = < y1,...,yn >, a sequence U = < u1,...,uk > is a common supersequence of X and Y if items can be removed from U to produce X and Y. A shortest common supersequence (SCS) is a common supersequence of minimal length. In the shortest common
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Shortest_common_supersequence
date created:
date modified:
2023-12-03T06:44:47Z
main entity:
{"identifier":"Q11789272","url":"https://www.wikidata.org/entity/Q11789272"}
image:
fields total:
13
integrity:
13