Bioinformatics Advance Access originally published online on November 14, 2008
Bioinformatics 2009 25(1):105-111; doi:10.1093/bioinformatics/btn597
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Combining multiple positive training sets to generate confidence scores for protein–protein interactions
1Center for Molecular Medicine and Genetics and 2Department of Biochemistry and Molecular Biology, School of Medicine, Wayne State University, 540 East Canfield, Detroit, MI 48201, USA
*To whom correspondence should be addressed.
| Abstract |
|---|
Motivation: High-throughput experimental and computational methods are generating a wealth of protein–protein interaction data for a variety of organisms. However, data produced by current state-of-the-art methods include many false positives, which can hinder the analyses needed to derive biological insights. One way to address this problem is to assign confidence scores that reflect the reliability and biological significance of each interaction. Most previously described scoring methods use a set of likely true positives to train a model to score all interactions in a dataset. A single positive training set, however, may be biased and not representative of true interaction space.
Results: We demonstrate a method to score protein interactions by utilizing multiple independent sets of training positives to reduce the potential bias inherent in using a single training set. We used a set of benchmark yeast protein interactions to show that our approach outperforms other scoring methods. Our approach can also score interactions across data types, which makes it more widely applicable than many previously proposed methods. We applied the method to protein interaction data from both Drosophila melanogaster and Homo sapiens. Independent evaluations show that the resulting confidence scores accurately reflect the biological significance of the interactions.
Contact: rfinley{at}wayne.edu
Supplementary information: Supplementary data are available at Bioinformatics Online.
Associate Editor: Burkhard Rost
Received on June 26, 2008; revised on November 12, 2008; accepted on November 13, 2008