Predicting Co-Complexed Protein Pairs from Heterogeneous Data

@article{10.1371/journal.pcbi.1000054, abstract = {Proteins do not carry out their functions alone. Instead, they often act by participating in macromolecular complexes and play different functional roles depending on the other members of the complex. It is therefore interesting to identify co-complex relationships. Although protein complexes can be identified in a high-throughput manner by experimental technologies such as affinity purification coupled with mass spectrometry (APMS), these large-scale datasets often suffer from high false positive and false negative rates. Here, we present a computational method that predicts co-complexed protein pair (CCPP) relationships using kernel methods from heterogeneous data sources. We show that a diffusion kernel based on random walks on the full network topology yields good performance in predicting CCPPs from protein interaction networks. In the setting of direct ranking, a diffusion kernel performs much better than the mutual clustering coefficient. In the setting of SVM classifiers, a diffusion kernel performs much better than a linear kernel. We also show that combination of complementary information improves the performance of our CCPP recognizer. A summation of three diffusion kernels based on two-hybrid, APMS, and genetic interaction networks and three sequence kernels achieves better performance than the sequence kernels or diffusion kernels alone. Inclusion of additional features achieves a still better ROC50 of 0.937. Assuming a negative-to-positive ratio of 600∶1, the final classifier achieves 89.3\% coverage at an estimated false discovery rate of 10\%. Finally, we applied our prediction method to two recently described APMS datasets. We find that our predicted positives are highly enriched with CCPPs that are identified by both datasets, suggesting that our method successfully identifies true CCPPs. An SVM classifier trained from heterogeneous data sources provides accurate predictions of CCPPs in yeast. This computational method thereby provides an inexpensive method for identifying protein complexes that extends and complements high-throughput experimental data.}, author = {Qiu, Jian and Noble, William S. }, citeulike-article-id = {2693990}, doi = {10.1371/journal.pcbi.1000054}, journal = {PLoS Comput Biol}, keywords = {bioinformatics, complexes, interaction, kernels, prediction, protein-protein}, month = {Apr}, number = {4}, posted-at = {2008-04-21 03:12:15}, priority = {2}, publisher = {Public Library of Science}, title = {Predicting Co-Complexed Protein Pairs from Heterogeneous Data}, url = {http://dx.doi.org/10.1371\%2Fjournal.pcbi.1000054}, volume = {4}, year = {2008} }

TY - JOUR ID - 10.1371/journal.pcbi.1000054 L3 - citeulike-article-id:2693990 TI - Predicting Co-Complexed Protein Pairs from Heterogeneous Data JF - PLoS Comput Biol VL - 4 IS - 4 PB - Public Library of Science N2 - Proteins do not carry out their functions alone. Instead, they often act by participating in macromolecular complexes and play different functional roles depending on the other members of the complex. It is therefore interesting to identify co-complex relationships. Although protein complexes can be identified in a high-throughput manner by experimental technologies such as affinity purification coupled with mass spectrometry (APMS), these large-scale datasets often suffer from high false positive and false negative rates. Here, we present a computational method that predicts co-complexed protein pair (CCPP) relationships using kernel methods from heterogeneous data sources. We show that a diffusion kernel based on random walks on the full network topology yields good performance in predicting CCPPs from protein interaction networks. In the setting of direct ranking, a diffusion kernel performs much better than the mutual clustering coefficient. In the setting of SVM classifiers, a diffusion kernel performs much better than a linear kernel. We also show that combination of complementary information improves the performance of our CCPP recognizer. A summation of three diffusion kernels based on two-hybrid, APMS, and genetic interaction networks and three sequence kernels achieves better performance than the sequence kernels or diffusion kernels alone. Inclusion of additional features achieves a still better ROC50 of 0.937. Assuming a negative-to-positive ratio of 600∶1, the final classifier achieves 89.3% coverage at an estimated false discovery rate of 10%. Finally, we applied our prediction method to two recently described APMS datasets. We find that our predicted positives are highly enriched with CCPPs that are identified by both datasets, suggesting that our method successfully identifies true CCPPs. An SVM classifier trained from heterogeneous data sources provides accurate predictions of CCPPs in yeast. This computational method thereby provides an inexpensive method for identifying protein complexes that extends and complements high-throughput experimental data. KW - bioinformatics KW - complexes KW - interaction KW - kernels KW - prediction KW - protein-protein AU - Qiu, Jian AU - Noble, William PY - 2008/Apr// UR - http://dx.doi.org/10.1371%2Fjournal.pcbi.1000054 ER -