Home > Term: heaviest common subsequence
heaviest common subsequence
The problem of finding a maximum length (or maximum weight) subsequence of two or more strings.
- Kalbos dalis: noun
- Pramonės šaka / sritis: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Kūrėjas
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
