An FPT-Algorithm for Longest Common Subsequence Parameterized by the Maximum Number of Deletions.
Annual Symposium on Combinatorial Pattern Matching (CPM)（2022）
关键词
longest common subsequence parameterized,deletions,fpt-algorithm
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要