Cargando…
CUFID-query: accurate network querying through random walk based network flow estimation
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...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5751815/ https://www.ncbi.nlm.nih.gov/pubmed/29297279 http://dx.doi.org/10.1186/s12859-017-1899-y |
_version_ | 1783290025075539968 |
---|---|
author | Jeong, Hyundoo Qian, Xiaoning Yoon, Byung-Jun |
author_facet | Jeong, Hyundoo Qian, Xiaoning Yoon, Byung-Jun |
author_sort | Jeong, Hyundoo |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-5751815 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2017 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-57518152018-01-05 CUFID-query: accurate network querying through random walk based network flow estimation Jeong, Hyundoo Qian, Xiaoning Yoon, Byung-Jun BMC Bioinformatics Research 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. BioMed Central 2017-12-28 /pmc/articles/PMC5751815/ /pubmed/29297279 http://dx.doi.org/10.1186/s12859-017-1899-y Text en © The Author(s) 2017 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. |
spellingShingle | Research Jeong, Hyundoo Qian, Xiaoning Yoon, Byung-Jun CUFID-query: accurate network querying through random walk based network flow estimation |
title | CUFID-query: accurate network querying through random walk based network flow estimation |
title_full | CUFID-query: accurate network querying through random walk based network flow estimation |
title_fullStr | CUFID-query: accurate network querying through random walk based network flow estimation |
title_full_unstemmed | CUFID-query: accurate network querying through random walk based network flow estimation |
title_short | CUFID-query: accurate network querying through random walk based network flow estimation |
title_sort | cufid-query: accurate network querying through random walk based network flow estimation |
topic | Research |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5751815/ https://www.ncbi.nlm.nih.gov/pubmed/29297279 http://dx.doi.org/10.1186/s12859-017-1899-y |
work_keys_str_mv | AT jeonghyundoo cufidqueryaccuratenetworkqueryingthroughrandomwalkbasednetworkflowestimation AT qianxiaoning cufidqueryaccuratenetworkqueryingthroughrandomwalkbasednetworkflowestimation AT yoonbyungjun cufidqueryaccuratenetworkqueryingthroughrandomwalkbasednetworkflowestimation |