A mixed clustering coefficient centrality for identifying essential proteins
Essential protein plays a crucial role in the process of cell life. The identification of essential proteins can not only promote the development of drug target technology, but also contribute to the mechanism of biological evolution. There are plenty of scholars who pay attention to discovering essential proteins according to the topological structure of protein network and biological information. The accuracy of protein recognition still demands to be improved. In this paper, we propose a method which integrate the clustering coefficient in protein complexes and topological properties to determine the essentiality of proteins. First, we give the definition of In-clustering coefficient (IC) to describe the properties of protein complexes. Then we propose a new method, complex edge and node clustering coefficient (CENC) to identify essential proteins. Different Protein-Protein Interaction (PPI) networks of Saccharomyces cerevisiae, MIPS and DIP are used as experimental materials. Through some experiments of logistic regression model, the results show that the method of CENC can promote the ability of recognizing essential proteins, by comparing with the existing methods DC, BC, EC, SC, LAC, NC and the recent method UC.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringNode ClusteringSimilar Papers 제목 키워드 기반
A stochastic block model for community detection in attributed networks
Community detection is an important content in complex network analysis. The existing community detection methods in attributed networks mostly focus on only using network structure, while the methods of integrating node…
ClusteringCommunity DetectionStochastic Block ModelGraph Neural Networks for Scalable and Transferable Node Centrality Approximation
Graph Neural Networks (GNNs) provide a learning-based framework for approximating graph quantities that are expensive to compute exactly. This paper investigates GNNs for scalable approximation of betweenness and closene…
Mixed strategy approach destabilizes cooperation in finite populations with clustering coefficient
Evolutionary game theory, encompassing discrete, continuous, and mixed strategies, is pivotal for understanding cooperation dynamics. Discrete strategies involve deterministic actions with a fixed probability of one, whe…
ClusteringA Modular Framework for Centrality and Clustering in Complex Networks
The structure of many complex networks includes edge directionality and weights on top of their topology. Network analysis that can seamlessly consider combination of these properties are desirable. In this paper, we stu…
BenchmarkingClusteringGraph ClusteringTwo new methods for identifying proteins based on the domain protein complexes and topological properties
The recognition of essential proteins not only can help to understand the mechanism of cell operation, but also help to study the mechanism of biological evolution. At present, many scholars have been discovering essenti…