e/Shortest common supersequence

Information
has gloss	eng: This shortest common supersequence problem is 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 U is a supersequence of both X and Y.
lexicalization	eng: shortest common supersequence
instance of	c/Algorithms on strings