A new approximation algorithm for the minimum fragment removal problem

Abstract

In this paper, we present a new approximation Minimum Fragment Removal (MFR) algorithm based on a new Optimization Vertex Bipartization (OVB) one. Our approximation MFR algorithm is of complexity O(n2) in computing time, where n is the number of the vertices of the conflict graph. Then, we present the results obtained after running the program corresponding to our algorithm on random graphs and on graphs from Computational Molecular Biology. © Springer-Verlag Berlin Heidelberg 2008.