Home > Term: heaviest common subsequence
heaviest common subsequence
The problem of finding a maximum length (or maximum weight) subsequence of two or more strings.
- ส่วนหนึ่งของคำพูด: noun
- อุตสาหกรรม/ขอบเขต: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
ผู้สร้าง
- GeorgeV
- 100% positive feedback