Before revision:  Our results include the first constant factor approximation algorithm for bicluster deletion . We illustrate the flexibility of our framework in several experiments .
After revision:  Our results include the first constant factor approximation algorithm for bicluster deletion , the task of removing a minimum number of edges to partition a bipartite graph into disjoint bi-cliques. In several experimental results, we highlight the flexibility of our framework in several experiments .