Computational approaches for prioritizing candidate disease genes based on PPI networks

77Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.

Abstract

With the continuing development and improvement of genome-wide techniques, a great number of candidate genes are discovered. How to identify the most likely disease genes among a large number of candidates becomes a fundamental challenge in human health. A common view is that genes related to a specific or similar disease tend to reside in the same neighbourhood of biomolecular networks. Recently, based on such observations, many methods have been developed to tackle this challenge. In this review, we firstly introduce the concept of disease genes, their properties, and available data for identifying them. Then we review the recent computational approaches for prioritizing candidate disease genes based on Protein-Protein Interaction (PPI) networks and investigate their advantages and disadvantages. Furthermore, some pieces of existing software and network resources are summarized. Finally, we discuss key issues in prioritizing candidate disease genes and point out some future research directions.

Cite

CITATION STYLE

APA

Lan, W., Wang, J., Li, M., Peng, W., & Wu, F. (2015). Computational approaches for prioritizing candidate disease genes based on PPI networks. Tsinghua Science and Technology, 20(5), 500–512. https://doi.org/10.1109/TST.2015.7297749

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