A Graph Modification Approach for Finding Core-Periphery Structures in Protein Interaction Networks.
Algorithms for Molecular Biology(2014)
摘要
The core–periphery model for protein interaction (PPI) networks assumes that protein complexes in these networks consist of a dense core and a possibly sparse periphery that is adjacent to vertices in the core of the complex. In this work, we aim at uncovering a global core–periphery structure for a given PPI network. We propose two exact graph-theoretic formulations for this task, which aim to fit the input network to a hypothetical ground truth network by a minimum number of edge modifications. In one model each cluster has its own periphery, and in the other the periphery is shared. We first analyze both models from a theoretical point of view, showing their NP-hardness. Then, we devise efficient exact and heuristic algorithms for both models and finally perform an evaluation on subnetworks of the S. cerevisiae PPI network.
更多查看译文
关键词
Integer Linear Programming, Genetic Interaction, Cluster Graph, Split Graph, Induce Subgraph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络