期刊文献+

Prioritization of orphan disease-causing genes using topological feature and GO similarity between proteins in interaction networks 被引量:6

Prioritization of orphan disease-causing genes using topological feature and GO similarity between proteins in interaction networks
原文传递
导出
摘要 Identification of disease-causing genes among a large number of candidates is a fundamental challenge in human disease studies.However,it is still time-consuming and laborious to determine the real disease-causing genes by biological experiments.With the advances of the high-throughput techniques,a large number of protein-protein interactions have been produced.Therefore,to address this issue,several methods based on protein interaction network have been proposed.In this paper,we propose a shortest path-based algorithm,named SPranker,to prioritize disease-causing genes in protein interaction networks.Considering the fact that diseases with similar phenotypes are generally caused by functionally related genes,we further propose an improved algorithm SPGOranker by integrating the semantic similarity of gene ontology(GO)annotations.SPGOranker not only considers the topological similarity between protein pairs in a protein interaction network but also takes their functional similarity into account.The proposed algorithms SPranker and SPGOranker were applied to 1598 known orphan disease-causing genes from 172 orphan diseases and compared with three state-of-the-art approaches,ICN,VS and RWR.The experimental results show that SPranker and SPGOranker outperform ICN,VS,and RWR for the prioritization of orphan disease-causing genes.Importantly,for the case study of severe combined immunodeficiency,SPranker and SPGOranker predict several novel causal genes. Identification of disease-causing genes among a large number of candidates is a fundamental challenge in human disease stud- ies. However, it is still time-consuming and laborious to determine the real disease-causing genes by biological experiments. With the advances of the high-throughput techniques, a large number of protein-protein interactions have been produced. Therefore, to address this issue, several methods based on protein interaction network have been proposed. In this paper, we propose a shortest path-based algorithm, named SPranker, to prioritize disease-causing genes in protein interaction networks. Considering the fact that diseases with similar phenotypes are generally caused by functionally related genes, we further pro- pose an improved algorithm SPGOranker by integrating the semantic similarity of gene ontology (GO) annotations. SPGOranker not only considers the topological similarity between protein pairs in a protein interaction network but also takes their functional similarity into account. The proposed algorithms SPranker and SPGOranker were applied to 1598 known or- phan disease-causing genes from 172 orphan diseases and compared with three state-of-the-art approaches, ICN, VS and RWR The experimental results show that SPranker and SPGOranker outperform ICN, VS, and RWR for the prioritization of orphan disease-causing genes. Importantly, for the case study of severe combined immunodeficiency, SPranker and SPGOranker predict several novel causal genes.
出处 《Science China(Life Sciences)》 SCIE CAS 2014年第11期1064-1071,共8页 中国科学(生命科学英文版)
基金 supported in part by the National Natural Science Foundation of China(61370024,61428209,61232001) Program for New Century Excellent Talents in University(NCET-12-0547)
关键词 disease-causing genes PRIORITIZATION gene ontology protein interaction network shortest path 蛋白质相互作用网络 语义相似度 致病基因 拓扑 蛋白相互作用 人类疾病 生物实验 基因本体论
  • 相关文献

参考文献1

二级参考文献29

  • 1Kumar A, Snyder M. Protein complexes take the bait. Nature, 2002, 415(6868): 123-124. 被引量:1
  • 2Li M, Wang J X, Chen J E. A fast agglomerate algorithm for mining functional modules in protein interaction networks. In: Proceedings of International Conference on BioMedical Engineering and Informatics. Sanya, China, 2008. 被引量:1
  • 3Chua H N, Ning K, Sung W K, Leong H W, Wong L. Using indirect protein-protein interactions for protein complex prediction. J. Bioinform. Comput. Biol., 2008, 6(3): 435- 466. 被引量:1
  • 4Spirin V, Mirny L A. Protein complexes and functional modules in molecular networks. In: Proceedings of the National Academy of Sciences of Unitied States of America. The National Academy of Sciences, USA, 2003. 被引量:1
  • 5Pei P, Zhang A. A seed-refine algorithm for detecting protein complexes from protein interaction data. IEEE Transactions on Nanobioscience, 2007, 6(1): 43-50. 被引量:1
  • 6Afnizanfaizal A, Safaai D, Siti Z M H, Hamimah M. Graph partitioning method for functional module detections of protein interaction network. In: International Conference on Computer Technology and Development. Washington D.C., USA, 2009. 被引量:1
  • 7Bader G, Hogue C. An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics, 2003, 4(2): 1-27. 被引量:1
  • 8Zhang S, Ning X, Liu H, Zhang X. Prediction of protein complexes based on protein interaction data and functional annotation data using kernel methods. In: International Conference on Intelligent Computing. Springer-Verlag Berlin, Heidelberg, 2006. 被引量:1
  • 9Adamcsek B. CFinder: Locating cliques and overlapping modules in biological networks. Bioinformatics, 2006, 22(8): 1021-1023. 被引量:1
  • 10Li X, Tan S, Foo C, Ng S. Interaction graph mining for protein complexes using local clique merging. Genome Informatics, 2005, 16(2): 260-269. 被引量:1

同被引文献21

引证文献6

二级引证文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部