Protein function prediction with the shortest path in functional linkage graph and boosting

  • Authors:
  • Xing-/Ming Zhao;Luonan Chen;Kazuyuki Aihara

  • Affiliations:
  • Shanghai Univ, Shanghai, China/ ERATO Aihara Complexity Modelling Project, JST, Tokyo, Japan/ Intelligent Computing Lab, Hefei Institute of Intelligent Machines, Chinese Academy of Sciences, Hefei ...;Shanghai Univ, Shanghai, China/ ERATO Aihara Complexity Modelling Project, JST, Tokyo, Japan/ Univ of Tokyo, Tokyo, Japan/ Dept of Electrical Engineering and Electronics, Osaka Sangyo Univ, Osaka, ...;ERATO Aihara Complexity Modelling Project, JST, Tokyo, 151-/0064, Japan/ Institute of Industrial Science, The University of Tokyo, Tokyo 153-/8505, Japan

  • Venue:
  • International Journal of Bioinformatics Research and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Annotating proteins with biological functions is one of the main goals in post genomic era. Various high-throughout technologies, e.g., yeast two-hybrid systems and microarray, have provided an alternative way to protein function prediction. Despite the success obtained by high-throughout data, the errors in the data have not been handled well. In this work, a new technique for protein function prediction is presented, where a weighted functional linkage graph is generated by exploiting the existing protein-protein interaction data, complex data and gene expression data. By finding the shortest path in the functional linkage graph, the functional links among proteins can be captured. With the functional links available, the functions of unknown proteins can be predicted utilising support vector machines and the functions of those proteins that have functional links to the unknown proteins. In addition, the boosting algorithm is employed to further improve the prediction accuracy. The experiments on yeast genes show promising results and prove the efficiency of the proposed methods.