Abstract
Abstract In this paper we study the biclique k -clustering problem (B k CP) 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 k CP 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
