title: Dynamically searching for a domain for protein function prediction.
abstract: The availability of large amounts of protein-protein interaction (PPI) data makes it feasible to use computational approaches to predict protein functions. The base of existing computational approaches is to exploit the known function information of annotated proteins in the PPI data to predict functions of un-annotated proteins. However, these approaches consider the prediction domain (i.e. the set of proteins from which the functions are predicted) as unchangeable during the prediction procedure. This may lead to valuable information being overwhelmed by the unavoidable noise information in the PPI data when predicting protein functions, and in turn, the prediction results will be distorted. In this paper, we propose a novel method to dynamically predict protein functions from the PPI data. Our method regards the function prediction as a dynamic process of finding a suitable prediction domain, from which representative functions of the domain are selected to predict functions of un-annotated proteins. Our method exploits the topological structural information of a PPI network and the semantic relationship between protein functions to measure the relationship between proteins, dynamically select a suitable prediction domain and predict functions. The evaluation on real PPI datasets demonstrated the effectiveness of our proposed method, and generated better prediction results.
authors.affiliation: School of Information Technology, Deakin University, 221 Burwood Highway, Burwood, Victoria 3125, Australia. jingyu@deakin.edu.au
authors.forename: Jingyu
authors.initials: J
authors.lastname: Hou
authors.forename: Yongqing
authors.initials: Y
authors.lastname: Jiang
mesh_terms: D030562:Databases, Protein; D058977:Molecular Sequence Annotation; D025941:Protein Interaction Mapping / Q000379:methods*; D011506:Proteins / Q000737:chemistry* / Q000378:metabolism*; D040901:Proteomics / Q000379:methods*
chemical_list: D011506:Proteins