Computational Prediction of Protein Function Based on Weighted Mapping of Domains and GO Terms

الملخص EN

In this paper, we propose a novel method, SeekFun, to predict protein function based on weighted mapping of domains and GO terms.

Firstly, a weighted mapping of domains and GO terms is constructed according to GO annotations and domain composition of the proteins.

The association strength between domain and GO term is weighted by symmetrical conditional probability.

Secondly, the mapping is extended along the true paths of the terms based on GO hierarchy.

Finally, the terms associated with resident domains are transferred to host protein and real annotations of the host protein are determined by association strengths.

Our careful comparisons demonstrate that SeekFun outperforms the concerned methods on most occasions.

SeekFun provides a flexible and effective way for protein function prediction.

It benefits from the well-constructed mapping of domains and GO terms, as well as the reasonable strategy for inferring annotations of protein from those of its domains.