相似性(几何)
计算机科学
最长公共子序列
聚类系数
子串
节点(物理)
生物网络
功能(生物学)
相似性度量
公制(单位)
度量(数据仓库)
理论计算机科学
编辑距离
交互网络
数据挖掘
集合(抽象数据类型)
拓扑(电路)
算法
数学
聚类分析
人工智能
组合数学
基因
生物
物理
遗传学
运营管理
量子力学
经济
图像(数学)
程序设计语言
标识
DOI:10.1109/tcbb.2022.3185406
摘要
Interaction networks can be used to predict the functions of unknown proteins using known interactions and proteins with known functions. Many graph theory or diffusion-based methods have been proposed, using the assumption that the topological properties of a protein in a network are related to its biological function. Here we seek to improve function prediction by finding more similar neighbors with a new diffusion-based alignment technique to overcome the topological information loss of the node. In this study, we introduce the Diffusion Alignment Coefficient (DAC) algorithm, which combines diffusion, longest common subsequence, and longest common substring techniques to measure the similarity of two nodes in protein interaction networks. As a proof of concept, our experiments, conducted on a real PPI networks S.cerevisiae and Homo Sapiens, demonstrated that our method obtained better results than competitors for MIPS and MSigDB Collections hallmark gene set functional categories. This is the first study to develop a measure of node function similarity using alignment to consider the positions of nodes in protein-protein interaction networks. According to the experimental results, the use of spatial information belonging to the nodes in the network has a positive effect on the detection of more functionally similar neighboring nodes.
科研通智能强力驱动
Strongly Powered by AbleSci AI