CUFID-query: accurate network querying through random walk based network flow estimation

被引:2
|
作者
Jeong, Hyundoo [1 ,2 ,3 ]
Qian, Xiaoning [1 ,4 ]
Yoon, Byung-Jun [1 ,4 ]
机构
[1] Texas A&M Univ, Dept Elect & Comp Engn, College Stn, TX 77843 USA
[2] Baylor Coll Med, Dept Neuroogy, Houston, TX 77030 USA
[3] Texas Childrens Hosp, Jan & Dan Duncan Neurol Res Inst, Houston, TX 77030 USA
[4] TEES AgriLife Ctr Bioinformat & Genom Syst Engn C, College Stn, TX 77845 USA
来源
BMC BIOINFORMATICS | 2017年 / 18卷
基金
美国国家科学基金会;
关键词
Comparative network analysis; Network querying; Random walk; PROTEIN-INTERACTION NETWORKS; TOOL; ALIGNMENT;
D O I
10.1186/s12859-017-1899-y
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: Functional modules in biological networks consist of numerous biomolecules and their complicated interactions. Recent studies have shown that biomolecules in a functional module tend to have similar interaction patterns and that such modules are often conserved across biological networks of different species. As a result, such conserved functional modules can be identified through comparative analysis of biological networks. Results: In this work, we propose a novel network querying algorithm based on the CUFID (Comparative network analysis Using the steady-state network Flow to IDentify orthologous proteins) framework combined with an efficient seed-and-extension approach. The proposed algorithm, CUFID-query, can accurately detect conserved functional modules as small subnetworks in the target network that are expected to perform similar functions to the given query functional module. The CUFID framework was recently developed for probabilistic pairwise global comparison of biological networks, and it has been applied to pairwise global network alignment, where the framework was shown to yield accurate network alignment results. In the proposed CUFID-query algorithm, we adopt the CUFID framework and extend it for local network alignment, specifically to solve network querying problems. First, in the seed selection phase, the proposed method utilizes the CUFID framework to compare the query and the target networks and to predict the probabilistic node-to-node correspondence between the networks. Next, the algorithm selects and greedily extends the seed in the target network by iteratively adding nodes that have frequent interactions with other nodes in the seed network, in a way that the conductance of the extended network is maximally reduced. Finally, CUFID-query removes irrelevant nodes from the querying results based on the personalized PageRank vector for the induced network that includes the fully extended network and its neighboring nodes. Conclusions: Through extensive performance evaluation based on biological networks with known functional modules, we show that CUFID-query outperforms the existing state-of-the-art algorithms in terms of prediction accuracy and biological significance of the predictions.
引用
收藏
页数:14
相关论文
共 50 条
  • [1] CUFID-query: accurate network querying through random walk based network flow estimation
    Hyundoo Jeong
    Xiaoning Qian
    Byung-Jun Yoon
    BMC Bioinformatics, 18
  • [2] SEQUOIA: significance enhanced network querying through context-sensitive random walk and minimization of network conductance
    Jeong, Hyundoo
    Yoon, Byung-Jun
    BMC SYSTEMS BIOLOGY, 2017, 11
  • [3] SEQUOIA: Significance enhanced network querying through context-sensitive random walk and minimization of network conductance
    Jeong, Hyundoo
    Yoon, Byung-Jun
    PROCEEDINGS OF THE 7TH ACM INTERNATIONAL CONFERENCE ON BIOINFORMATICS, COMPUTATIONAL BIOLOGY, AND HEALTH INFORMATICS, 2016, : 535 - 536
  • [4] Accurate multiple network alignment through context-sensitive random walk
    Jeong, Hyundoo
    Yoon, Byung-Jun
    BMC SYSTEMS BIOLOGY, 2015, 9
  • [5] DiffuseNet: A Random Walk Based Anonymity Network
    Fleming, Charles
    Zhou, Xing
    Liu, Dawei
    Liang, Haining
    2014 IEEE INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING, COMMUNICATIONS AND COMPUTING (ICSPCC), 2014, : 877 - 880
  • [6] The Random Walk Model Based on Bipartite Network
    Zhang, Man-Dun
    Chang, Shun-Shun
    Zhao, Jia-Wei
    Ma, Jian-Hong
    3RD ANNUAL INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND APPLICATIONS (ITA 2016), 2016, 7
  • [7] An efficient network querying method based on conditional random fields
    Huang, Qiang
    Wu, Ling-Yun
    Zhang, Xiang-Sun
    BIOINFORMATICS, 2011, 27 (22) : 3173 - 3178
  • [8] Tactical Asset Allocation Through Random Walk on Stock Network
    Freitas, Washington Burkart
    Bertini Junior, João Roberto
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2021, 13073 LNAI : 528 - 542
  • [9] Research on Graph Network Recommendation Algorithm Based on Random Walk and Convolutional Neural Network
    Huang, Meng
    2021 INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE BIG DATA AND INTELLIGENT SYSTEMS (HPBD&IS), 2021, : 57 - 64
  • [10] Random walk through a stock network and predictive analysis for portfolio optimization
    Freitas, Washington Burkart
    Junior, Joao Roberto Bertini
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 218