首页 > Term: longest common subsequence
longest common subsequence
The problem of finding a maximum length (or maximum weight) subsequence of two or more strings.
0
创建者
- GeorgeV
-
(Gold) 1123 分数 - 100% positive feedback
