Definition: Find the longest substring of two or more strings.
See also longest common subsequence, shortest common superstring.
Note: The longest common substring is contiguous, while the longest common subsequence need not be.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 4 March 2019.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "longest common substring", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 4 March 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/longestCommonSubstring.html