World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Mon, Jun 21st, 2021 at 1am (EDT)

During this period, the E-commerce and registration of new users may not be available for up to 6 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

A LINEAR-TIME ALGORITHM FOR PREDICTING FUNCTIONAL ANNOTATIONS FROM PPI NETWORKS

    Recent proteome-wide screening efforts have made available genome-wide, high-throughput protein–protein interaction (PPI) maps for several model organisms. This has enabled the systematic analysis of PPI networks, which has become one of the primary challenges for the systems biology community. Here, we address the problem of predicting the functional classes of proteins (i.e. GO annotations) based solely on the structure of the PPI network. We present a maximum likelihood formulation of the problem and the corresponding learning and inference algorithms. The time complexity of both algorithms is linear in the size of the PPI network, and our experimental results show that their accuracy in functional prediction outperforms current existing methods.

    A preliminary version of this work was presented at the 7th International Workshop on Data Mining in Bioinformatics, San Jose, CA, and included in its Proceedings (2007).

    References