The NP-hard Minimum Common String Partition problem asks whether two strings x and y can each be partitioned into at most k substrings such that both partitions use exactly the same substrings in a different order. We present the first fixed-parameter algorithm for Minimum Common String Partition using only parameter k.
Recently, Bulteau and Komusiewicz REF have introduced the first fixed-parameter algorithm for the MCSP problem using parameter k only.
Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable
ArXiv
ArXiv
Mathematics Computer Science