Home > Term: heaviest common subsequence
heaviest common subsequence
The problem of finding a maximum length (or maximum weight) subsequence of two or more strings.
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
-
(Gold) 1123 poin - 100% positive feedback
