Identifying protein complexes in high-throughput protein interaction screens using an infinite latent feature model

18Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a Bayesian approach to identify protein complexes and their constituents from high-throughput protein-protein interaction screens. An infinite latent feature model that allows for multi-complex membership by individual proteins is coupled with a graph diffusion kernel that evaluates the likelihood of two proteins belonging to the same complex. Gibbs sampling is then used to infer a catalog of protein complexes from the interaction screen data. An advantage of this model is that it places no prior constraints on the number of complexes and automatically infers the number of significant complexes from the data. Validation results using affinity purification/mass spectrometry experimental data from yeast RNA-processing complexes indicate that our method is capable of partitioning the data in a biologically meaningful way. A supplementary web site containing larger versions of the figures is available at http;//public,kgi.edu/~wiId/PSB06/index.html.

Cite

CITATION STYLE

APA

Chu, W., Ghahramani, Z., Krause, R., & Wild, D. L. (2006). Identifying protein complexes in high-throughput protein interaction screens using an infinite latent feature model. In Proceedings of the Pacific Symposium on Biocomputing 2006, PSB 2006 (pp. 231–242). https://doi.org/10.1142/9789812701626_0022

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free