NIST

shortest common supersequence

(classic problem)

Definition: Find the shortest string that contains two or more strings as subsequences.

See also shortest common superstring, longest common subsequence.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.

Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.

Cite this as:
Paul E. Black, "shortest common supersequence", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/shortestCommonSuperseq.html

to NIST home page