摘要
The Minimum Fragments Removal (MFR) problem is one of the haplotyping problems: given a set of fragments, remove the minimum number of fragments so that the resulting fragments can be partitioned into k classes of non-conflicting subsets. In this paper, we formulate the κ-MFR problem as an integer linear programming problem, and develop a dynamic programming approach to solve the κ-MFR problem for both the gapless and gap eases.
The Minimum Fragments Removal (MFR) problem is one of the haplotyping problems: given a set of fragments, remove the minimum number of fragments so that the resulting fragments can be partitioned into k classes of non-conflicting subsets. In this paper, we formulate the κ-MFR problem as an integer linear programming problem, and develop a dynamic programming approach to solve the κ-MFR problem for both the gapless and gap eases.
基金
Supported by the National Natural Science Foundation of China (No. 60503004, No. 10471141). Thc authors gratefully acknowledge the support of K.G.Wang Education Foundation of Hong Kong.