Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks

DOI10.1287/ijoc.2018.0872zbMath1451.90033arXiv1708.00574OpenAlexW2963952675WikidataQ127669441 ScholiaQ127669441MaRDI QIDQ5139626

Mustafa Can Camur, Chrysafis Vogiatzis

Publication date: 9 December 2020

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.00574

zbMATH Keywords

centralitycomplex network analysisprotein-protein interaction networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Medical applications (general) (92C50) Approximation algorithms (68W25)

Related Items (4)

The Star Degree Centrality Problem: A Decomposition Approach ⋮ Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures ⋮ The stochastic pseudo-star degree centrality problem ⋮ A survey of computational methods in protein-protein interaction networks

Uses Software

• NetworkX
• Gurobi
• STRING

Cites Work

• Identifying sets of key players in a social network
• Centers of complex networks
• An integer programming approach for finding the most and the least central cliques
• On network-based kernel methods for protein-protein interactions with applications in protein functions prediction
• The centrality of groups and classes

This page was built for publication: Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks