Home > Term: longest common subsequence
longest common subsequence
The problem of finding a maximum length (or maximum weight) subsequence of two or more strings.
- Szófaj: noun
- Ipar/Tárgykör: Computer science
- Kategória: Algorithms & data structures
- Government Agency: NIST
0
Szerzőb
- GeorgeV
- 100% positive feedback