Comparing protein interaction networks via a graph match-and-split algorithm.
We present a method that compares the protein interaction networks of two species to detect functionally similar (conserved) protein modules between them. The method is based on an algorithm we developed to identify matching subgraphs between two graphs. Unlike previous network comparison methods, our algorithm has provable guarantees on correctness and efficiency. Our algorithm framework also admits quite general criteria that define when two subgraphs match and constitute a conserved module. We apply our method to pairwise comparisons of the yeast protein network with the human, fruit fly and nematode worm protein networks, using a lenient criterion based on connectedness and matching edges, coupled with a clustering heuristic. In evaluations of the detected conserved modules against reference yeast protein complexes, our method performs competitively with and sometimes better than two previous network comparison methods. Further, under some conditions (proper homolog and species selection), our method performs better than a popular single-species clustering method. Beyond these evaluations, we discuss the biology of a couple of conserved modules detected by our method. We demonstrate the utility of network comparison for transferring annotations from yeast proteins to human ones, and validate the predicted annotations. Supplemental text is available at www.cs.berkeley.edu/ approximately nmani/M-and-S/supplement.pdf.
Narayanan
Manikandan
M
Computer Science Division, University of California, Berkeley, California 94720, USA. nmani@cs.berkeley.edu
Karp
Richard M
RM
D000465:Algorithms; D030562:Databases, Protein; D006801:Humans; D008954:Models, Biological; D025941:Protein Interaction Mapping / Q000379:methods*; D011506:Proteins / Q000235:genetics / Q000378:metabolism; D029701:Saccharomyces cerevisiae Proteins / Q000235:genetics / Q000378:metabolism