Candidate gene prioritization.
Candidate gene identification is typically labour intensive, involving laboratory experiments required to corroborate or disprove any hypothesis for a nominated candidate gene being considered the causative gene. The traditional approach to reduce the number of candidate genes entails fine-mapping studies using markers and pedigrees. Gene prioritization establishes the ranking of candidate genes based on their relevance to the biological process of interest, from which the most promising genes can be selected for further analysis. To date, many computational methods have focused on the prediction of candidate genes by analysis of their inherent sequence characteristics and similarity with respect to known disease genes, as well as their functional annotation. In the last decade, several computational tools for prioritizing candidate genes have been proposed. A large number of them are web-based tools, while others are standalone applications that install and run locally. This review attempts to take a close look at gene prioritization criteria, as well as candidate gene prioritization algorithms, and thus provide a comprehensive synopsis of the subject matter.
Laboratory of Systems Biology and Bioinformatics, Institute of Biochemistry and Biophysics, University of Tehran, Tehran, Iran. amasoudin@ibb.ut.ac.ir
Ali
A
Masoudi-Nejad
Alireza
A
Meshkin
Behzad
B
Haji-Eghrari
Gholamreza
G
Bidkhori
D000465:Algorithms; D000818:Animals; D056726:Genetic Association Studies / Q000379:methods*; D020022:Genetic Predisposition to Disease; D006801:Humans; D020407:Internet; D051379:Mice; D008957:Models, Genetic; D051381:Rats; D012984:Software