Home > Term: heaviest common subsequence
heaviest common subsequence
The problem of finding a maximum length (or maximum weight) subsequence of two or more strings.
- Part of Speech: noun
- Industry/Domain: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Creator
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
