Author(s)

Hong-Biao Liu, Juan Liu, Lian Wang

School of Computer, Wuhan University, Wuhan 430079, China.

Searching the maximum bicliques or bipartite subgraphs in a graph is a tough question. We proposed a new and efficient method, Searching Quasi-Bicliques (SQB) algorithm, to detect maximum quasi-bicliques from protein-protein interaction network. As a Divide-and-Conquer method, SQB consists of three steps: first, it divides the protein-protein interaction network into a number of Distance-2-Subgraphs; second, by combining top-down and branch-and-bound methods, SQB seeks quasi-bicliques from every Distance-2-Subgraph; third, all the redundant results are removed. We successfully applied our method on the Saccharomyces cerevisiae dataset and obtained 2754 distinct quasi-bicliques.

Searching Quasi-Bicliques algorithm; Quasi-biclique; Protein-Protein Interaction Network; Distance-2-Subgraph; Di-vide-and-Conquer method

Liu, H. , Liu, J. and Wang, L. (2008) Searching maximum quasi-bicliques from protein-protein interaction network. Journal of Biomedical Science and Engineering, 1, 200-203. doi: 10.4236/jbise.2008.13034.