Search - MCSP - CodeBus

Search - MCSP - List

[Other] MCSP DL : 0: 计算两个字符串的最小公共子串划分（MCSP）。最小公共子串划分（MCSP)是指把两个字符串划分成相同的子串的集合，同时要求划分的子串数目最少。比如，S1 = cdabcdabceab，S2 = abceabcdabcd,求得的MCSP是(cdabcd, abceab), (abceab, cdabcd).MCSP问题是基因重组中的关键问题，并且与用逆转重复字串进行排序的问题十分相近。MCSP问题是NP难的。-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.
Date : 2025-07-16 Size : 3kb User : luckypig
[JSP/Java] MCSP DL : 0: 给出一串数字数，查找出乘积最大的子数字串-A series of numbers given the number of children find a product of the maximum number of strings
Date : 2025-07-16 Size : 9kb User : lucheng