Abstract
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.
Similar content being viewed by others
Article PDF
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bhattacharyya, M., Bandyopadhyay, S. & Maulik, U. Finding Bicliques in Digraphs: Application into Viral-host Protein Interactome. Nat Prec (2012). https://doi.org/10.1038/npre.2012.7148.1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/npre.2012.7148.1