Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
From MaRDI portal
Abstract: In this work, we propose a novel centrality metric, referred to as star centrality, which incorporates information from the closed neighborhood of a node, rather than solely from the node itself, when calculating its topological importance. More specifically, we focus on degree centrality and show that in the complex protein-protein interaction networks it is a naive metric that can lead to misclassifying protein importance. For our extension of degree centrality when considering stars, we derive its computational complexity, provide a mathematical formulation, and propose two approximation algorithms that are shown to be efficient in practice. We portray the success of this new metric in protein-protein interaction networks when predicting protein essentiality in several organisms, including the well-studied Saccharomyces cerevisiae, Helicobacter pylori, and Caenorhabditis elegans, where star centrality is shown to significantly outperform other nodal centrality metrics at detecting essential proteins. We also analyze the average and worst case performance of the two approximation algorithms in practice, and show that they are viable options for computing star centrality in very large-scale protein-protein interaction networks, such as the human proteome, where exact methodologies are bound to be time and memory intensive.
Recommendations
- Characterization of essential proteins based on network topology in proteins interaction networks
- A local average connectivity-based method for identifying essential proteins from the network level
- An efficient strategy for identifying essential proteins based on homology, subcellular location and protein-protein interaction information
- Research in Computational Molecular Biology
Cites work
- An integer programming approach for finding the most and the least central cliques
- Centers of complex networks
- Identifying sets of key players in a social network
- On network-based kernel methods for protein-protein interactions with applications in protein functions prediction
- The centrality of groups and classes
Cited in
(10)- A novel extended Pareto optimality consensus model for predicting essential proteins
- Predicting essential proteins from protein-protein interactions using order statistics
- A survey of computational methods in protein-protein interaction networks
- A local average connectivity-based method for identifying essential proteins from the network level
- Identification of essential nodes based on topology of a bionetwork
- The star degree centrality problem: a decomposition approach
- Characterization of essential proteins based on network topology in proteins interaction networks
- Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures
- The stochastic pseudo-star degree centrality problem
- A survey on optimization studies of group centrality metrics
This page was built for publication: Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139626)
