Protein Function Prediction by Random Walks on a Hybrid Graph

被引:5
|
作者
Liu, Jie [1 ]
Wang, Jun [1 ]
Yu, Guoxian [1 ,2 ,3 ]
机构
[1] Southwest Univ, Coll Comp & Informat Sci, Chongqing 400715, Peoples R China
[2] Jilin Univ, Key Lab Symbol Computat & Knowledge Engn, Minist Educ, Changchun 130023, Peoples R China
[3] George Mason Univ, Dept Comp Sci, Fairfax, VA 22030 USA
关键词
Protein function prediction; hybrid graph; function correlations; PPI network; GENE ONTOLOGY; FRAMEWORK; NETWORK; INTERRELATIONSHIPS; COMPLEXES; SEQUENCE;
D O I
10.2174/157016461302160514004307
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: Proteins participate in various essential processes of life and hence accurately annotating functional roles of proteins can elucidate the understanding of life and diseases. Objective: Various network-based function prediction models have been proposed to predict protein functions using protein-protein interactions networks, while most of them do not make use of function correlations in functional inference. Furthermore, these models suffer from false positive interactions. Our aim is to solve these problems with advanced machine learning techniques. Method: In this paper, we introduce an approach called protein function prediction by random walks on a hybrid graph (ProHG). ProHG not only takes into account of the function correlation and direct interactions, but also indirect interactions between proteins by functional similarity weight (FS-weight) to alleviate noisy interactions. Results: Experiments on three public accessible PPI networks show that ProHG can take advantage of function correlations and indirect interactions between proteins for function predictions, and it achieves better performance than other related approaches. Conclusion: The extensive empirical study demonstrates that our proposed ProHG is superior to other related methods for function prediction in most cases, and using indirect interactions can boost the performance of network-based function prediction.
引用
收藏
页码:130 / 142
页数:13
相关论文
共 50 条
  • [31] Visual Tracking via Random Walks on Graph Model
    Li, Xiaoli
    Han, Zhifeng
    Wang, Lijun
    Lu, Huchuan
    IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (09) : 2144 - 2155
  • [32] 2–3 Paths in a Lattice Graph: Random Walks
    Ya. M. Erusalimskii
    Mathematical Notes, 2018, 104 : 395 - 403
  • [33] Random Walks And The Colored Jones Function
    Stavros Garoufalidis*
    Martin Loebl†
    Combinatorica, 2005, 25 : 651 - 671
  • [34] FlashWalker: An In-Storage Accelerator for Graph Random Walks
    Niu, Fuping
    Yue, Jianhui
    Shen, Jiangqiu
    Liao, Xiaofei
    Liu, Haikun
    Jin, Hai
    2022 IEEE 36TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2022), 2022, : 1063 - 1073
  • [35] Random Walks on the Bipartite-Graph for Personalized Recommendation
    Pei, Zhong-you
    Chiang, Chun-heng
    Lin, Wen-bin
    2013 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE (ICCSAI 2013), 2013, : 97 - 102
  • [36] Random walks and the colored Jones function
    Caroufalidis, S
    Loebl, M
    COMBINATORICA, 2005, 25 (06) : 651 - 671
  • [37] Two particles' repelling random walks on the complete graph
    Chen, Jun
    ELECTRONIC JOURNAL OF PROBABILITY, 2014, 19
  • [38] Estimating graph parameters via random walks with restarts
    Ben-Hamou, Anna
    Oliveira, Roberto I.
    Peres, Yuval
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1702 - 1714
  • [39] Recommendation algorithm based on random walks in a bipartite graph
    Gama, Ricardo
    André, Nuno
    Pereira, César
    Almeida, Luís
    Pinto, Pedro
    RISTI - Revista Iberica de Sistemas e Tecnologias de Informacao, 2011, (08): : 15 - 24
  • [40] Random Walks Analysis on Graph Modelled Multimodal Collections
    Sabetghadam, Serwah
    Lupu, Mihai
    Rauber, Andreas
    SEMANTIC KEYWORD-BASED SEARCH ON STRUCTURED DATA SOURCES, IKC 2016, 2017, 10151 : 76 - 88