메뉴 건너뛰기




Volumn , Issue , 2016, Pages 927-934

A study of gene prioritization algorithms on PPI networks

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE; PROTEINS;

EID: 85007389386     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICACCI.2016.7732164     Document Type: Conference Paper
Times cited : (5)

References (28)
  • 1
    • 41549139527 scopus 로고    scopus 로고
    • Walking the interactome for prioritization of candidate disease genes
    • Sebastian Kohler et al. "Walking the Interactome for Prioritization of Candidate Disease Genes", Amer. J. human genetics, vol. 82, no. 4, pp. 949-958, 2008.
    • (2008) Amer. J. Human Genetics , vol.82 , Issue.4 , pp. 949-958
    • Kohler, S.1
  • 3
    • 84871193073 scopus 로고    scopus 로고
    • A propagation-based algorithm for inferring gene-disease associations
    • Oron Vanunu, Roded Sharan. "A Propagation-based Algorithm for Inferring Gene-Disease Associations" in Proc. German Conf. Bioinformatics, 2008.
    • (2008) Proc. German Conf. Bioinformatics
    • Vanunu, O.1    Sharan, R.2
  • 4
    • 33947095027 scopus 로고    scopus 로고
    • A human phenome-interactome network of protein complexes implicated in genetic disorders
    • Lage et al. "A human phenome-interactome network of protein complexes implicated in genetic disorders", Nat. Biotechnol., vol. 25, no. 3, pp. 309-316, 2007.
    • (2007) Nat. Biotechnol , vol.25 , Issue.3 , pp. 309-316
    • Lage1
  • 5
    • 77956477380 scopus 로고    scopus 로고
    • Candidate gene prioritization by network analysis of differential expression using machine learning approaches
    • Nitsch D et al. "Candidate gene prioritization by network analysis of differential expression using machine learning approaches", BMC Bioinformatics, vol. 11, no. 1, pp. 1-16, 2010.
    • (2010) BMC Bioinformatics , vol.11 , Issue.1 , pp. 1-16
    • Nitsch, D.1
  • 8
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • J. Kleinberg. "Authoritative sources in a hyperlinked environment", J. ACM (JACM), vol. 46, no. 5, pp. 604-632, 1999
    • (1999) J. ACM (JACM) , vol.46 , Issue.5 , pp. 604-632
    • Kleinberg, J.1
  • 10
    • 12344273375 scopus 로고    scopus 로고
    • Biological network comparison using graphlet degree distribution
    • N. Pruzulj et al. "Biological network comparison using graphlet degree distribution", BMC Bioinformatics, vol. 20, no. 18, pp. 3508-3515, 2004.
    • (2004) BMC Bioinformatics , vol.20 , Issue.18 , pp. 3508-3515
    • Pruzulj, N.1
  • 11
    • 41949139082 scopus 로고    scopus 로고
    • Fitting a geometric graph to a protein-protein interaction network
    • D. J. Higham, M. Rasajski, and N. Pruzulj. "Fitting a geometric graph to a protein-protein interaction network", textit Bioinformatics, vol. 24, no. 8, pp. 1093-1099, 2008.
    • (2008) Textit Bioinformatics , vol.24 , Issue.8 , pp. 1093-1099
    • Higham, D.J.1    Rasajski, M.2    Pruzulj, N.3
  • 13
    • 73249152476 scopus 로고    scopus 로고
    • Disease candidate gene identification and prioritization using protein interaction networks
    • Chen J et al. "Disease candidate gene identification and prioritization using protein interaction networks". BMC Bioinformatics, vol. 10, no. 73, 2009.
    • (2009) BMC Bioinformatics , vol.10 , Issue.73
    • Chen, J.1
  • 14
    • 0742305866 scopus 로고    scopus 로고
    • Network biology: Understanding the cell's functional organization
    • A. L. Barabási, Z. N. Oltvai. "Network biology: understanding the cell's functional organization", Nature Rev. Genet., vol. 5, no. 2, pp. 101-114, 2004
    • (2004) Nature Rev. Genet , vol.5 , Issue.2 , pp. 101-114
    • Barabási, A.L.1    Oltvai, Z.N.2
  • 15
    • 24944565272 scopus 로고    scopus 로고
    • Some protein interaction data do not exhibit power law statistics
    • Reiko Tanakaa et al. "Some protein interaction data do not exhibit power law statistics", FEBS Letters, vol. 579, pp. 5140-5144, 2005
    • (2005) FEBS Letters , vol.579 , pp. 5140-5144
    • Tanakaa, R.1
  • 16
    • 85007288941 scopus 로고    scopus 로고
    • Tell me more: Finding related items from user provided feedback
    • Jeroen De Knijf et al. "Tell Me More: Finding Related Items from User Provided Feedback". Discovery Sci., vol. 11, no. 2, pp. 76-90, 2011
    • (2011) Discovery Sci , vol.11 , Issue.2 , pp. 76-90
    • De Knijf, J.1
  • 17
    • 79959464683 scopus 로고    scopus 로고
    • DADA: Degree-aware algorithms for network-based disease gene
    • Sinan Erten et al. "DADA: Degree-Aware Algorithms for Network-Based Disease Gene", BioData Mining, vol. 4, no. 1, pp. 1-20, 2011
    • (2011) BioData Mining , vol.4 , Issue.1 , pp. 1-20
    • Erten, S.1
  • 18
    • 3142700120 scopus 로고    scopus 로고
    • Link analysis: Hubs and authorities on the world wide web
    • Chris H. Q. et al. "Link Analysis: Hubs and Authorities on the World Wide Web". SIAM Review, vol. 46, no. 2, pp. 256-268, 2004.
    • (2004) SIAM Review , vol.46 , Issue.2 , pp. 256-268
    • Chris, H.Q.1
  • 19
    • 84907020096 scopus 로고    scopus 로고
    • Heat kernel based community detection
    • Kyle Kloster, David F. Gleich. "Heat kernel based community detection" in KDD'14, 2014
    • (2014) KDD'14
    • Kloster, K.1    Gleich, D.F.2
  • 20
    • 84906232105 scopus 로고    scopus 로고
    • Deeper inside pagerank
    • Amy N. Langville, Carl D. Meyer. "Deeper Inside PageRank". Internet Math., vol. 1, pp. 335-400, 2004
    • (2004) Internet Math , vol.1 , pp. 335-400
    • Langville, A.N.1    Meyer, C.D.2
  • 21
    • 34748827346 scopus 로고    scopus 로고
    • Fast random walk with restart and its application
    • Hanghang Tong et al. "Fast Random Walk with Restart and Its Application". ICDM, 2006.
    • (2006) ICDM
    • Tong, H.1
  • 22
    • 79959922954 scopus 로고    scopus 로고
    • PINTA: A web server for network-based gene prioritization from expression data
    • (Web Server issue)
    • Nitsch et al. "PINTA: A web server for network-based gene prioritization from expression data" Nucleic Acids Research vol. 39 (Web Server issue), pp. W334-W338, 2011
    • (2011) Nucleic Acids Research , vol.39 , pp. W334-W338
    • Nitsch1
  • 23
    • 77952376110 scopus 로고    scopus 로고
    • Algorithms for estimating relative importance in networks
    • White S, Smyth P. "Algorithms for estimating relative importance in networks" in Proc. SIGKDD, pp. 266-275, 2006.
    • (2006) Proc. SIGKDD , pp. 266-275
    • White, S.1    Smyth, P.2
  • 24
    • 77951952127 scopus 로고    scopus 로고
    • The power of protein interaction networks for associating genes with diseases
    • S. Navlakha and C. Kingsford. "The power of protein interaction networks for associating genes with diseases" Bioinformatics 26. 8 (2010): 1057-1063.
    • (2010) Bioinformatics , vol.26 , Issue.8 , pp. 1057-1063
    • Navlakha, S.1    Kingsford, C.2
  • 25
    • 80054991882 scopus 로고    scopus 로고
    • Network-based methods for human disease gene prediction
    • X. Wang, N. Gulbahce, and H. Yu. "Network-based methods for human disease gene prediction. " Briefings in functional genomics 10. 5 (2011): 280-293.
    • (2011) Briefings in Functional Genomics , vol.10 , Issue.5 , pp. 280-293
    • Wang, X.1    Gulbahce, N.2    Yu, H.3
  • 26
    • 84863987708 scopus 로고    scopus 로고
    • Computational tools for prioritizing candidate genes: Boosting disease gene discovery
    • Y. Moreau, and L-C Tranchevent. "Computational tools for prioritizing candidate genes: boosting disease gene discovery. " Nature Reviews Genetics 13. 8 (2012): 523-536.
    • (2012) Nature Reviews Genetics , vol.13 , Issue.8 , pp. 523-536
    • Moreau, Y.1    Tranchevent, L.-C.2
  • 27
    • 79959898376 scopus 로고    scopus 로고
    • Prioritizing candidate disease genes by networkbased boosting of genome-wide association data
    • Lee, Insuk, et al. "Prioritizing candidate disease genes by networkbased boosting of genome-wide association data. " Genome research 21. 7 (2011): 1109-1121.
    • (2011) Genome Research , vol.21 , Issue.7 , pp. 1109-1121
    • Lee, I.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.