NIST

heaviest common subsequence

(classic problem)

Definition: See longest common subsequence.

Author: CRC-A


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 2 September 2014.
HTML page formatted Tue Jan 16 10:34:44 2018.

Cite this as:
Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "heaviest common subsequence", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/heaviestCommonSubsequence.html