Definition: Either longest common subsequence or longest common substring.
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 6 July 2006.
HTML page formatted Mon Feb 2 13:10:39 2015.
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: http://www.nist.gov/dads/HTML/LCS.html