Hybrid Metaheuristic for Bicluster Editing Problem

The NP-hard Bicluster Editing Problem consists of adding and/or removing at most k edges to make a bipartite graph G = ( V , E ) a vertex-disjoint union of complete bipartite subgraphs. It has applications in the analysis of gene expression data. We propose the metaheuristics GRASP and VNS, and their hybridization, for the Bicluster Editing Problem, as well as a heuristic construction based on intersection neighborhood set.