Finding Bicliques in Digraphs: Application into Viral-Host Protein Interactome
We provide the first formalization true to the best of our knowledge to the problem of finding bicliques in a directed graph. The problem is addressed employing a two-stage approach based on an existing biclustering algorithm. This novel problem is useful in several biological applications of which we focus only on analyzing the viral-host protein interaction graphs. Strong and significant bicliques of HIV-1 and human proteins are derived using the proposed methodology, which provides insights into some novel regulatory functionalities in case of the acute immunodeficiency syndrome in human.
KeywordsGene Ontology Bipartite Graph Human Protein Interaction Matrix Biclustering Algorithm
- 3.Cheng, Y., Church, G.: Biclustering of Expression Data. In: Proceedings of the 8th ISMB Conference, AAAI Press, pp. 93–103. AAAI Press, Menlo Park (2000)Google Scholar
- 4.Ding, C., Zhang, Y., Li, T.: Biclustering Protein Complex Interactions with a Biclique Finding Algorithm. In: Proceedings of the Sixth International Conference on Data Mining, Hong Kong, pp. 178–187 (2006)Google Scholar
- 7.Pandey, G., Atluri, G., Steinbach, M., Myers, C.L., Kumar, V.: An Association Analysis Approach to Biclustering. In: Proceedings of the 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Paris, France (2009)Google Scholar