Systematic identification of functional orthologs based on protein network comparison

  1. Sourav Bandyopadhyay1,2,
  2. Roded Sharan3,4, and
  3. Trey Ideker1,2,4
  1. 1 Program in Bioinformatics, University of California at San Diego, La Jolla, California 92093, USA
  2. 2 Department of Bioengineering, University of California at San Diego, La Jolla, California 92093, USA
  3. 3 School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel

Abstract

Annotating protein function across species is an important task that is often complicated by the presence of large paralogous gene families. Here, we report a novel strategy for identifying functionally related proteins that supplements sequence-based comparisons with information on conserved protein–protein interactions. First, the protein interaction networks of two species are aligned by assigning proteins to sequence homology clusters using the Inparanoid algorithm. Next, probabilistic inference is performed on the aligned networks to identify pairs of proteins, one from each species, that are likely to retain the same function based on conservation of their interacting partners. Applying this method to Drosophila melanogaster and Saccharomyces cerevisiae, we analyze 121 cases for which functional orthology assignment is ambiguous when sequence similarity is used alone. In 61 of these cases, the network supports a different protein pair than that favored by sequence comparisons. These results suggest that network analysis can be used to provide a key source of information for refining sequence-based homology searches.

Footnotes

  • [Supplemental material is available online at www.genome.org and http://www.cellcircuits.org/Bandyopadhyay2006/.]

  • Article published online ahead of print. Article and publication date are at http://www.genome.org/cgi/doi/10.1101/gr.4526006.

  • 4 Corresponding authors. E-mail roded{at}tau.ac.il; fax 972-3-6409357. E-mail trey{at}bioeng.ucsd.edu; fax (858) 534-5722.

    • Accepted November 21, 2005.
    • Received August 3, 2005.
| Table of Contents

Preprint Server