Abstract

Protein-protein interactions (PPIs) are of biological interest for their active participation in coordinating a number of cellular processes in living organisms. This paper attempts to formulate PPIs as an optimization problem with an aim to independently maximize (a) the stability of a complex formed by two proteins predicted to be interacting, (b) the difference between their individual accessible solvent area and that of the corresponding protein-protein complex, (c) their functional similarity and d) the occurrence of their interacting domain pairs. The novelty of the paper lies in ranking the set of PPI networks, obtained through independently optimizing individual objectives, using two approaches. The first approach is concerned with identifying the equally good PPI networks based on their fitness-based ranks with respect to individual four objectives. The second approach aims at sorting the PPI networks based on their fuzzy memberships to satisfy individual four objectives. The paper also proposes a novel single objective optimization algorithm to optimize individual objectives, influencing the true prediction of a PPI network. The proposed algorithm is realized by an amalgamation of the differential evolution and the stochastic learning automata, where the former is employed to globally explore the search space and the latter for the adaptive tuning of the control parameter of the algorithm. The proposed technique outperforms the existing methods, including relative specific similarity, domain cohesion coupling, random decision forest, fuzzy support vector machine and evolutionary/swarm algorithm based approaches, with respect to both sensitivity and specificity.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.