(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 6 July 2006.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "LCS", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 6 July 2006. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/LCS.html