Bashiri Hamid, Rahmani Hossein, Bashiri Vahid, Módos Dezső, Bender Andreas
School of Computer engineering, Iran University of Science and Technology, Tehran, 16846-13114, Iran.
School of Computer engineering, Iran University of Science and Technology, Tehran, 16846-13114, Iran.
Comput Biol Med. 2020 May;120:103740. doi: 10.1016/j.compbiomed.2020.103740. Epub 2020 Apr 4.
Discovering important proteins in Protein-Protein Interaction (PPI) networks has attracted a lot of attention in recent years. Most of the previous work applies different network centrality measures such as Closeness, Betweenness, PageRank and many others to discover the most influential proteins in PPI networks. Although entropy is a well-known graph-based method in computer science, according to our knowledge, it is not used in the biology domain for this purpose. In this paper, first, we annotate the human PPI network with available annotation data. Second, we introduce a new concept called annotation-context that describes each protein according to annotation data of its neighbors. Third, we apply an entropy measure to discover proteins with varied annotation-context. Empirical results indicate that our proposed method succeeded in (1) differentiating essential and non-essential proteins in PPI networks with annotation data; (2) outperforming centrality measures in the task of discovering essential nodes; (3) predicting new annotated proteins based on existing annotation data.
近年来,在蛋白质 - 蛋白质相互作用(PPI)网络中发现重要蛋白质引起了广泛关注。之前的大多数工作都应用了不同的网络中心性度量方法,如紧密性、介数、PageRank等,来发现PPI网络中最具影响力的蛋白质。尽管熵是计算机科学中一种著名的基于图的方法,但据我们所知,它尚未在生物学领域用于此目的。在本文中,首先,我们用可用的注释数据对人类PPI网络进行注释。其次,我们引入了一个名为注释上下文的新概念,根据其邻居的注释数据来描述每个蛋白质。第三,我们应用熵度量来发现具有不同注释上下文的蛋白质。实证结果表明,我们提出的方法成功地(1)利用注释数据区分PPI网络中的必需和非必需蛋白质;(2)在发现必需节点的任务中优于中心性度量方法;(3)基于现有注释数据预测新的注释蛋白质。