The Greedy Algorithm for the Minimum Common String Partition Problem


In the Minimum Common String Partition problem (MCSP), we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the number of the substrings in the partition. This problem is NP-hard, even for a special case, denoted 2-MCSP, where each letter occurs at most twice in each input string. We study a… (More)
DOI: 10.1145/1103963.1103971


1 Figure or Table

Slides referencing similar topics