An algorithm for network-based gene prioritization that encodes knowledge both in nodes and in links

5Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

Abstract

Background: Candidate gene prioritization aims to identify promising new genes associated with a disease or a biological process from a larger set of candidate genes. In recent years, network-based methods - which utilize a knowledge network derived from biological knowledge - have been utilized for gene prioritization. Biological knowledge can be encoded either through the network's links or nodes. Current network-based methods can only encode knowledge through links. This paper describes a new network-based method that can encode knowledge in links as well as in nodes. Results: We developed a new network inference algorithm called the Knowledge Network Gene Prioritization (KNGP) algorithm which can incorporate both link and node knowledge. The performance of the KNGP algorithm was evaluated on both synthetic networks and on networks incorporating biological knowledge. The results showed that the combination of link knowledge and node knowledge provided a significant benefit across 19 experimental diseases over using link knowledge alone or node knowledge alone. Conclusions: The KNGP algorithm provides an advance over current network-based algorithms, because the algorithm can encode both link and node knowledge. We hope the algorithm will aid researchers with gene prioritization. © 2013 Kimmel, Visweswaran.

Cite

CITATION STYLE

APA

Kimmel, C., & Visweswaran, S. (2013). An algorithm for network-based gene prioritization that encodes knowledge both in nodes and in links. PLoS ONE, 8(11). https://doi.org/10.1371/journal.pone.0079564

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free