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 November 2020.
HTML page formatted Mon Nov 2 12:36:42 2020.

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