Utilizing Both Topological and Attribute Information for Protein Complex Identification in PPI Networks
Issue No. 03 - May-June (2013 vol. 10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2013.37
Allen L. Hu , The Hong Kong Polytechnic University, Hong Kong
Keith C.C. Chan , The Hong Kong Polytechnic University, Hong Kong
Many computational approaches developed to identify protein complexes in protein-protein interaction (PPI) networks perform their tasks based only on network topologies. The attributes of the proteins in the networks are usually ignored. As protein attributes within a complex may also be related to each other, we have developed a PCIA algorithm to take into consideration both such information and network topology in the identification process of protein complexes. Given a PPI network, PCIA first finds information about the attributes of the proteins in a PPI network in the Gene Ontology databases and uses such information for the identification of protein complexes. PCIA then computes a Degree of Association measure for each pair of interacting proteins to quantitatively determine how much their attribute values associate with each other. Based on this association measure, PCIA is able to discover dense graph clusters consisting of proteins whose attribute values are significantly closer associated with each other. PCIA has been tested with real data and experimental results seem to indicate that attributes of the proteins in the same complex do have some association with each other and, therefore, that protein complexes can be more accurately identified when protein attributes are taken into consideration.
Markov clustering, PPI networks, graph clustering, protein complex, gene ontology,
Allen L. Hu, Keith C.C. Chan, "Utilizing Both Topological and Attribute Information for Protein Complex Identification in PPI Networks", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 10, no. , pp. 780-792, May-June 2013, doi:10.1109/TCBB.2013.37