Laurent Bulteau

An FPT-Algorithm for Longest Common Subsequence Parameterized by the Number of Deletions

2021 · HAL (Le Centre pour la Communication Scientifique Directe)

In the NP-hard Longest Common Subsequence problem (LCS), given a set of strings, the task is to find a string that can be obtained from every input string using as few deletions as possible. LCS …