(classic problem)
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.
Author: PEB
Dan Hirschberg's pseudocode as an example of dynamic programming.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 4 February 2009.
HTML page formatted Wed Feb 4 11:08:37 2009.
Cite this as:
Paul E. Black, "longest common substring", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 4 February 2009. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/longestCommonSubstring.html
