Bioinformatics Vol. 19 no. 15 2003
pages 1875-1881
© 2003 Oxford University Press
Learning to predict proteinprotein interactions from protein sequences
1 Unité de Biochimie et Biologie Moléculaire des Insectes, Institut Pasteur, 75724 Paris Cedex 15, France, 2 Department of Genome Sciences, University of Washington, Seattle, USA and 3 Columbia Genome Center, Center for Computational Biology and Bioinformatics (C2B2), Department of Biomedical Informatics, Columbia University, New York, USA
Received on May 1, 2003
; revised on July 15, 2003
; accepted on July 15, 2003
In order to understand the molecular machinery of the cell, we need to know about the multitude of proteinprotein interactions that allow the cell to function. High-throughput technologies provide some data about these interactions, but so far that data is fairly noisy. Therefore, computational techniques for predicting proteinprotein interactions could be of significant value. One approach to predicting interactions in silico is to produce from first principles a detailed model of a candidate interaction. We take an alternative approach, employing a relatively simple model that learns dynamically from a large collection of data. In this work, we describe an attractionrepulsion model, in which the interaction between a pair of proteins is represented as the sum of attractive and repulsive forces associated with small, domain- or motif-sized features along the length of each protein. The model is discriminative, learning simultaneously from known interactions and from pairs of proteins that are known (or suspected) not to interact. The model is efficient to compute and scales well to very large collections of data. In a cross-validated comparison using known yeast interactions, the attractionrepulsion method performs better than several competing techniques.
Contact: sgomez{at}pasteur.fr
* To whom correspondence should be addressed.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
Z. Wunderlich and L. A. Mirny Using genome-wide measurements for computational prediction of SH2-peptide interactions Nucleic Acids Res., August 1, 2009; 37(14): 4629 - 4641. [Abstract] [Full Text] [PDF] |
||||
![]() |
E. Akiva, Z. Itzhaki, and H. Margalit Built-in loops allow versatility in domain-domain interactions: Lessons from self-interacting domains PNAS, September 9, 2008; 105(36): 13292 - 13297. [Abstract] [Full Text] [PDF] |
||||
![]() |
R. Saeed and C. Deane An assessment of the uses of homologous interactions Bioinformatics, March 1, 2008; 24(5): 689 - 695. [Abstract] [Full Text] [PDF] |
||||
![]() |
N. Nagamine and Y. Sakakibara Statistical prediction of protein chemical interactions based on chemical structure and mass spectrometry data Bioinformatics, August 1, 2007; 23(15): 2004 - 2012. [Abstract] [Full Text] [PDF] |
||||
![]() |
S. J. Cockell, B. Oliva, and R. M. Jackson Structure-based evaluation of in silico predictions of protein protein interactions using Comparative Docking Bioinformatics, March 1, 2007; 23(5): 573 - 581. [Abstract] [Full Text] [PDF] |
||||
![]() |
E. R. Jefferson, T. P. Walsh, T. J. Roberts, and G. J. Barton SNAPPI-DB: a database and API of Structures, iNterfaces and Alignments for Protein-Protein Interactions Nucleic Acids Res., January 12, 2007; 35(suppl_1): D580 - D589. [Abstract] [Full Text] [PDF] |
||||
![]() |
E. Sprinzak, Y. Altuvia, and H. Margalit Colloquium Papers: Characterization and prediction of protein-protein interactions within and between complexes PNAS, October 3, 2006; 103(40): 14718 - 14723. [Abstract] [Full Text] [PDF] |
||||
![]() |
E. Duprat, M.-P. Lefranc, and O. Gascuel A simple method to predict protein-binding from aligned sequences--application to MHC superfamily and {beta}2-microglobulin Bioinformatics, February 15, 2006; 22(4): 453 - 459. [Abstract] [Full Text] [PDF] |
||||
![]() |
Y. Liu, N. Liu, and H. Zhao Inferring protein-protein interactions through high-throughput interaction data from diverse organisms Bioinformatics, August 1, 2005; 21(15): 3279 - 3285. [Abstract] [Full Text] [PDF] |
||||


