Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem

In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem. We show that this problem is fixed-parameter tractable when parameterized by the number k of conserved duos, by first giving a parameterized algorithm based on the color-coding technique and then presenting a reduction to a kernel of size O(k^6 ).

💡 Research Summary

The paper investigates the parameterized complexity of the Maximum‑Duo Preservation String Mapping (Max‑Duo PSM) problem, which is the complementary formulation of the well‑studied Minimum Common String Partition (MCSP) problem. Given two related strings A and B (i.e., B is a permutation of A) of equal length n, a mapping m is a bijection between positions of A and positions of B that respects the underlying symbols. A duo is an ordered pair of consecutive symbols (S