Charles Explorer logo
🇬🇧

The greedy algorithm for the minimum common string partition problem

Publication at Faculty of Mathematics and Physics |
2004

Abstract

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, minimimizing the number of the substrings in the partition.