Protein function prediction with the shortest path in functional linkage graph and boosting
by Xing-Ming Zhao, Luonan Chen, Kazuyuki Aihara
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 4, No. 4, 2008

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.

Online publication date: Sat, 08-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com