NIST

LCS

(classic problem)

Definition: Either longest common subsequence or longest common substring.

Note: The longest common substring is contiguous, while the longest common subsequence need not be.

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 Black.

Entry modified 6 July 2006.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "LCS", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 6 July 2006. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/LCS.html