Definition: Find the shortest string that contains two or more strings as substrings.
See also shortest common supersequence, longest common substring.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 November 2020.
HTML page formatted Mon Nov 2 12:36:42 2020.
Cite this as:
Paul E. Black, "shortest common superstring", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 November 2020. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/shortestCommonSuperstring.html