蛋白质残基网络的局部搜索

摘要：

在蛋白质残基网络上进行自避免随机游走。与具有随机连接的蛋白质残基网络相比，（非随机）蛋白质残基网络中成功行走的概率较低，成功行走的长度较短。更少的成功行走和更短的成功行走表明蛋白质残基之间更高的通信特异性，这是蛋白质具有的一个可以想象的有利属性。使用随机游走，而不是最短路径也产生较低的节点中心性，较低的边缘介数和较低的边缘负载（非随机化）蛋白质残基网络比在各自的随机同行。蛋白质残基网络的这些属性的影响进行了讨论，在通信拥塞和网络脆弱性。随机化的蛋白质残基网络具有比（非随机化的）蛋白质残基网络更低的网络聚类。因此，我们的研究结果也揭示了一个迄今为止被忽视的方面：蛋白质残基网络中高网络聚类的重要性。高聚类增加了网络的局部搜索的可导航性，并且在高度聚类的小世界网络拓扑（例如蛋白质残基网络）上的局部搜索过程的组合减少了通信拥塞和网络脆弱性。

英文摘要：

Self-avoiding random walks were performed on protein residue networks. Compared with protein residue networks with randomized links, the probability of a walk being successful is lower and the length of successful walks shorter in (non-randomized) protein residue networks. Fewer successful walks and shorter successful walks point to higher communication specificity between protein residues, a conceivably favourable attribute for proteins to have. The use of random walks instead of shortest paths also produced lower node centrality, lower edge betweeness and lower edge load for (non-randomized) protein residue networks than in their respective randomized counterparts. The implications of these properties for protein residue networks are discussed in terms of communication congestion and network vulnerability. The randomized protein residue networks have lower network clustering than the (non-randomized) protein residue networks. Hence, our findings also shed light on a hitherto neglected aspect: the importance of high network clustering in protein residue networks. High clustering increases navigability of a network for local search and the combination of a local search process on a highly clustered small-world network topology such as protein residue networks reduces communication congestion and network vulnerability.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。