Description: The code is to compute MCSP of two given strings. The Minimum Common String Partition problem (MCSP) is to partition two given input strings into the same collection of substrings, where the number of substrings in the partition is minimized. This problem is a key problem in genome rearrangement, and is closely
related to the problem of sorting by reversals with duplicates. MCSP is NP-hard, even for the most trivial case, 2-MCSP, where each letter occurs at most twice in each input string.
- [zifuchuan] - Instance of Java source code associated
File list (Check if you may need any files):
MCSP\main.cpp
MCSP
Download