Abstract
Proteins and their interactions have been proven to play a central role in many cellular processes. Although there are many experimental techniques for protein-protein interaction prediction, only a few exist for predicting protein complexes. For the sake of this, researchers have emphasized lately in the computational prediction of protein complexes from Protein-Protein Interaction (PPI) data. The two major limitations of the current advances in the prediction of protein complexes are that most of the algorithms do not take into consideration the participation of a protein to many protein complexes and that they cannot handle weighted PPI graphs. In the present paper, we altered the original Restricted Neighborhood Search Clustering (RNSC) algorithm to overcome the above limitations. The Enhanced Weighted Restricted Neighborhood Search Clustering (EWRNSC) permits the participation of a protein to many protein complexes by modifying the moves of the original RNSC. In addition, EWRNSC can accept and process weighted PPI graphs as inputs by altering the cost functions of the original RNSC cost clustering schemes. When experimented using atasets from Human, the proposed algorithm proved to outperform the original RNSC and the MCL algorithms which are two of the most broadly used methods in the field of protein complexes prediction.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Theofilatos, K.A., Dimitrakopoulos, C.M., Tsakalidis, A.K., Likothanassis, S.D., Papadimitriou, S.T., Mavroudi, S.P.: Computational Approaches for the Prediction of Protein-Protein Interactions: A Survey. Current Bioinformatics 6(4), 398–414 (2011)
Spirin, V., Mirny, L.A.: Protein complexes and functional modules in molecular networks. Proc. Natl. Acad. Sci. USA 100(21), 12123–12128 (2003)
Bader, G.D., Hogue, C.W.V.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 4, 2 (2003)
Tamas, N., Haiyuan, Y., Alberto, P.: Detecting overlapping protein complexes in protein-protein interaction nteworks. Nature Methods 9, 471–472 (2012)
King, A.D.: Graph clustering with restricted neighbourhood search. Master’s thesis, University of Toronto (2004)
Keshava Prasad, T.S., Goel, R., Kandasamy, K., Keerthikumar, S., Kumar, S., Mathivanan, S., Telikicherla, D., Raju, R., Shafreen, B., Venugopal, A., Balakrishnan, L., Marimuthu, A., Banerjee, S., Somanathan, D.S., Sebastian, A., Rani, S., Ray, S., Harrys Kishore, C.J., Kanth, S., Ahmed, M., Kashyap, M.K., Mohmood, R., Ramachandra, Y.L., Krishna, V., Rahiman, B.A., Mohan, S., Ranganathan, P., Ramabadran, S., Chaerkady, R., Pandey, A.: Human Protein Reference Database—2009 update. Nucleic Acids Research 37, D767- D772 (2009)
Theofilatos, K., Pavlopoulou, N., Papasavvas, C., Likothanassis, S., Dimitrakopoulos, C., Georgopoulos, E., Moschopoulos, C., Mavroudi, S.: Evolutionary Enhanced Markov Clustering - EEMC: A Novel Unsupervised Methodology for Predicting Protein Complexes From Weighted Protein-Protein Interaction Graphs. In: Artificial Intelligence in Medicine (submitted)
Friedel, C., Krumsiek, J., Zimmer, R.: Bootstrapping the Interactome: Unsupervised Identification of Protein Complexes in Yeast. Journal of Computational Biology 16(8), 971–987 (2009)
Aloy, P., Bottcher, B., Ceulemans, H., Leutwein, C., Mellwig, C., Fischer, S., Gavin, A.C., Bork, P., Superti-Furga, G., Serrano, L., Russell, R.B.: Structure-based assembly of protein complexes in yeast. Science 303, 2026–2029 (2004)
Pu, S., Vlasblom, J., Emili, A., et al.: Identifying functional modules in the physical interactome of Saccharomyces cerevisiae. Proteomics 7, 944–960 (2007)
Brohee, S., van Helden, J.: Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinformatics 7, 488 (2006)
Ruepp, A., Waegele, B., Lechner, M., Brauner, B., Dunger-Kaltenbach, I., Fogo, G., Frishman, G., Montrone, C., Mewes, H.W.: CORUM: the comprehensive resource of mammalian protein complexes—2009. Nucleic Acids Research 38(database issue), D497–D501 (2009)
Ropodi, A., Sakkos, N., Moschopoulos, C., Magklaras, G., Kossida, S.: Superclusteroid: a Web tool dedicated to data processing of protein-protein interaction networks. EMBnet Journal 17(2), 10–15 (2011)
Theofilatos, K., Dimitrakopoulos, C., Kleftogiannis, D., Moschopoulos, C., Papadimitriou, S., Likothanassis, S., Mavroudi, S.: HINT-KB: The human interactome knowledge base. In: Iliadis, L., Maglogiannis, I., Papadopoulos, H., Karatzas, K., Sioutas, S. (eds.) Artificial Intelligence Applications and Innovations, Part II. IFIP AICT, vol. 382, pp. 612–621. Springer, Heidelberg (2012)
Wang, X., Zhengzhi, W., Jun, Y.: HKC: An Algorithm to Predict Protein Complexes in Protein-Protein Interaction Networks. Journal of Biomedicine and Biotechnology, Article ID 480294, 14 pages (2011), doi:10.1155/2011/480294
Wu, M., Li, X., Kwoh, C.K., Ng, S.K.: A core-attachment based method to detect protein complexes in PPI networks. BMC Bioinformatics 10, 169 (2009), doi:10.1186/1471-2105-10-169
King, A.D., Przulj, N., Jurisica, I.: Protein complex prediction via cost-based clustering. Bioinformatics 20(17), 3013–3020 (2004)
Van Dongen, S.: Graph clustering by flow simulation. In: PhD thesis Centers for mathematics and computer science (CWI), University of Utrecht (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dimitrakopoulos, C., Theofilatos, K., Pegkas, A., Likothanassis, S., Mavroudi, S. (2013). Enhanced Weighted Restricted Neighborhood Search Clustering: A Novel Algorithm for Detecting Human Protein Complexes from Weighted Protein-Protein Interaction Graphs. In: Iliadis, L., Papadopoulos, H., Jayne, C. (eds) Engineering Applications of Neural Networks. EANN 2013. Communications in Computer and Information Science, vol 384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41016-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-41016-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41015-4
Online ISBN: 978-3-642-41016-1
eBook Packages: Computer ScienceComputer Science (R0)