A survey of computational methods in protein–protein interaction networks

• Published in: Annals of operations research 2019-05, Vol.276 (1-2), p.35-87
• Main Authors: Rasti, Saeid, Vogiatzis, Chrysafis
• Format: Article
• Language: English
• Subjects: Applied mathematics; Business and Management; Combinatorics; Computation; Cybernetics; Interactomes; Kinases; Network analysis; Networks; Operations research; Operations Research/Decision Theory; Protein-protein interactions; Proteins; S.I.: Computational Biomedicine; Surveys; Theory of Computation
• ISSN: 0254-5330; 1572-9338
• DOI: 10.1007/s10479-018-2956-2

Protein–protein interaction networks are mathematical constructs where every protein is represented as a node, with an edge signaling that two proteins interact. These constructs have enabled a series of graph theoretic computational methods in the analysis of how cell life works. Such methods have found diverse applications from helping create more reliable interaction data, to identifying new protein complexes and predict their functionalities, and investigating the minimum requirements for cell life through protein essentiality. Our goal with this survey is to provide an overview of the research in the area from a network analysis perspective. In this work, we provide a brief introduction to protein–protein interaction networks, followed by the methods that we currently have to obtain such interactions and the databases they can be found at. Then, we proceed to discuss the network properties of protein–protein interaction networks and how they can be exploited to identify protein complexes and functional modules, as well as help classify proteins as essential. We finish this survey with a full bibliography on work in protein–protein interactions that could be of interest to operations research and computational science academicians and practitioners.