Abstract
Cluster Editing and Bicluster Editing are classical problems having various applications in computational biology and many other areas. Bicluster Editing asks whether we can transform a bipartite graph into a disjoint union of bicliques by adding and deleting at most k edges. In this paper, we give a branch-and-reduce algorithm for Bicluster Editing that runs in O⁎(2.9312k) time and polynomial space, improving the previous running-time bound of O⁎(3.24k).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have