Two Challenging Difficulties of Protein Complex Prediction
Abstract
A protein complex is a group of proteins which carries out particular functions in the cell. The component proteins of a protein complex are connected via weak physical contacts, called protein–protein interactions (PPIs). Proteome-wide PPIs are determined by high-throughput assays. Thus, it is interesting to computationally predict protein complexes from such PPIs. In this paper, we describe two challenging difficulties of the problem. The first difficulty is that the smallest protein complexes are of size two. It is quite difficult to predict them due to their simple inherent structure. The second difficulty is that some known complexes are overlapped with each other, because it is not trivial how to model such overlaps mathematically. For these issues, we have proposed our own approaches. In both methods, we design a scoring function and algorithms based on Markov chain Monte Carlo to optimize the scoring function. In this article, we briefly show our key regularization terms included in the whole scoring function.
Keywords
Protein complex Protein–protein interaction Markov chain Monte CarloNotes
Acknowledgements
This work was partially supported by JSPS KAKENHI Grant Number 26330330.
References
- 1.C.K. Widita, O. Maruyama, PPSampler2: predicting protein complexes more accurately and efficiently by sampling. BMC Syst. Biol. 7(Suppl 6), S14 (2013)Google Scholar
- 2.O. Maruyama, Y. Kuwahara, Rocsampler: regularizing overlapping protein complexes in protein-protein interaction networks, in Proceeding of 2016 IEEE 6th International Conference on Computational Advances in Bio and Medical Sciences (ICCABS) (IEEE, 2016). (The full version of this work is sumitted to a journal)Google Scholar
- 3.L. Kiemer, S. Costa, M. Ueffing, G. Cesareni, WI-PHI: a weighted yeast interactome enriched for direct physical interactions. Proteomics 7, 932–943 (2007)CrossRefGoogle Scholar
- 4.S. Pu, J. Wong, B. Turner, E. Cho, S.J. Wodak, Up-to-date catalogues of yeast protein complexes. Nucleic Acids Res. 37, 825–831 (2009)CrossRefGoogle Scholar
- 5.A. Clauset, C.R. Shalizi, M.E.J. Newman, Power-law distributions in empirical data. SIAM Rev. 51, 661–703 (2009)MathSciNetCrossRefMATHGoogle Scholar
- 6.A.J. Enright, S. Van Dongen, C.A. Ouzounis, An efficient algorithm for large-scale detection of protein families. Nucleic Acids Res. 30, 1575–1584 (2002)CrossRefGoogle Scholar
- 7.G.D. Bader, C.W.V. Hogue, An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinform. 4, 2 (2003)CrossRefGoogle Scholar
- 8.M. Altaf-Ul-Amin, Y. Shinbo, K. Mihara, K. Kurokawa, S. Kanaya, Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC Bioinform. 7, 207 (2006)CrossRefGoogle Scholar
- 9.G. Liu, L. Wong, H.N. Chua, Complex discovery from weighted PPI networks. Bioinformatics 25, 1891–1897 (2009)CrossRefGoogle Scholar
- 10.K. Macropol, T. Can, A.K. Singh, RRW: repeated random walks on genome-scale protein networks for local cluster discovery. BMC Bioinform. 10, 283 (2009)CrossRefGoogle Scholar
- 11.O. Maruyama, A. Chihara, NWE: node-weighted expansion for protein complex prediction using random walk distances. Proteome Sci. 9(Suppl 1), S14 (2011)CrossRefGoogle Scholar
- 12.S. Kobiki, O. Maruyama, ReSAPP: predicting overlapping protein complexes by merging multiple-sampled partitions of proteins. J. Bioinform. Comput. Biol. 12(6), 1442004 (2014)CrossRefGoogle Scholar
- 13.C.H. Yong, L. Wong, From the static interactome to dynamic protein complexes: three challenges. J. Bioinform. Comput. Biol. 13, 1571001 (2015)CrossRefGoogle Scholar
- 14.T. Nepusz, Y. Haiyuan, A. Paccanaro, Detecting overlapping protein complexes in protein-protein interaction networks. Nat. Methods 9, 471–472 (2012)CrossRefGoogle Scholar
- 15.P. Jiang, M. Singh, SPICi: a fast clustering algorithm for large biological networks. Bioinformatics 26, 1105–1111 (2010)CrossRefGoogle Scholar