Motivation: Protein complexes integrate multiple gene products to coordinate many biological functions. Given a graph representing pairwise protein interaction data one can search for subgraphs representing protein complexes. Previous methods for performing such search relied on the assumption that complexes form a clique in that graph. While this assumption is true for some complexes, it does not hold for many others. New algorithms are required in order to recover complexes with other types of topological structure.

Results: We present an algorithm for inferring protein complexes from weighted interaction graphs. By using graph topological patterns and biological properties as features, we model each complex subgraph by a probabilistic Bayesian network (BN). We use a training set of known complexes to learn the parameters of this BN model. The log-likelihood ratio derived from the BN is then used to score subgraphs in the protein interaction graph and identify new complexes. We applied our method to protein interaction data in yeast. As we show our algorithm achieved a considerable improvement over clique based algorithms in terms of its ability to recover known complexes. We discuss some of the new complexes predicted by our algorithm and determine that they likely represent true complexes.

Availability: Matlab implementation is available on the supporting website: www.cs.cmu.edu/~qyj/SuperComplex.

• PMID: 18586722
• DOI full text
• PMC full text
• PubMed
• PubTator

Reference Type

Journal Article | Research Support, N.I.H., Extramural | Research Support, Non-U.S. Gov't

Authors

Qi Y, Balem F, Faloutsos C, Klein-Seetharaman J, Bar-Joseph Z

Primary Lit For

Additional Lit For

Review For