In this paper we study the biclique k-clustering problem (B. kCP) in bipartite graphs, a generalization of the maximum edge biclique problem which has several applications in biological data analysis. We present an application of the B. kCP in bioinformatics, and introduce two integer linear formulations for the problem. Finally, we discuss the approximability of the problem and show computational experiments with random generated instances and also with instances that come the application. © 2010 Elsevier B.V.