A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A network flow approach to the Minimum Common Integer Partition Problem
2006
Theoretical Computer Science
In the k-Minimum Common Integer Partition Problem, abbreviated as k-MCIP, we are given k multisets X 1 , . . . , X k of positive integers, the goal is to find an integer multiset T of the minimum size such that for every i, we can partition each of the integers in X i so that the disjoint (multiset) union of their partitions equals T. This problem has applications in computational molecular biology, in particular, ortholog assignment and DNA hybridization fingerprint assembly. The problem is
doi:10.1016/j.tcs.2006.09.001
fatcat:5x36f4hwgve4lfpyyvfwz3ugrm