Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures
From MaRDI portal
Publication:6087561
DOI10.1002/net.22071zbMath1530.92063OpenAlexW3175941004MaRDI QIDQ6087561
Saeid Rasti, Chrysafis Vogiatzis
Publication date: 12 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22071
integer programmingcentralitybiological networksprotein-protein interaction networksnetwork structurescombinatorial branch-and-boundgroup centrality
Mixed integer programming (90C11) Biochemistry, molecular biology (92C40) Systems biology, networks (92C42)
Cites Work
- Unnamed Item
- Unnamed Item
- Identifying sets of key players in a social network
- Finding clique clusters with the highest betweenness centrality
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Incremental deployment of network monitors based on Group Betweenness Centrality
- The power grid as a complex network: a survey
- Detecting a most closeness-central clique in complex networks
- A survey of computational methods in protein-protein interaction networks
- An integer programming approach for finding the most and the least central cliques
- The centrality index of a graph
- The centrality of groups and classes
- Reducibility among Combinatorial Problems
- Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
- Finding groups with maximum betweenness centrality
- Network Analysis
This page was built for publication: Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures