Bioinformatics Advance Access published online on June 20, 2006
Bioinformatics, doi:10.1093/bioinformatics/btl335
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
1 School of Computing, National University of Singapore, Singapore 119260; Knowledge Discovery Department, Institute for Infocomm Research, Singapore 119613
* To whom correspondence should be addressed.
Motivation: Experimental limitations in high-throughput protein-protein interaction detection methods have resulted in low quality interaction datasets that contained sizable fractions of false positives and false negatives. Small-scale, focused experiments are then needed to complement the high throughput methods to extract true protein interactions. However, the naturally vast interactomes would require much more scalable approaches. Results: We describe a novel method called IRAP* as a computational complement for repurification of the highly erroneous experimentally-derived protein interactomes. Our method involves an iterative process of removing interactions that are confidently identified as false positives and adding interactions detected as false negatives into the interactomes. Identification of both false positives and false negatives are performed in IRAP* using interaction confidence measures based on network topological metrics. Potential false positives are identified amongst the detected interactions as those with very low computed confidence values, while potential false negatives are discovered as the undetected interactions with high computed confidence values. Our results from applying IRAP* on large-scale interaction data sets generated by the popular yeast-two-hybrid assays for yeast, fruit fly and worm showed that the computationally repurified interaction data sets contained potentially lower fractions of false positive and false negative errors based on functional homogeneity. Availability: The confidence indices for PPIs in yeast, fruit fly, and worm as computed by our method can be found at our web site http://www.comp.nus.edu.sg/~chenjin/fpfn. Supplementary information: Supplementary materials are available at Bioinformatics online.
Received February 17, 2006
Revised May 18, 2006
Accepted June 12, 2006
Article
Increasing confidence of protein interactomes using network topological metrics
Jin Chen 1,
Wynne Hsu 2,
Mong Li Lee 2,
and
See-Kiong Ng 3 *
2 School of Computing, National University of Singapore, Singapore 119260
3 Knowledge Discovery Department, Institute for Infocomm Research, Singapore 119613
See-Kiong Ng, E-mail: skng{at}i2r.a-star.edu.sg
Abstract
Associate Editor: Jonathan Wren
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  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]
|
|
|
|
 |
|
 M. Koegl and P. Uetz Improving yeast two-hybrid screening systems Brief Funct Genomic Proteomic, January 24, 2008; (2008) elm035v1. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
S. Asur, D. Ucar, and S. Parthasarathy An ensemble framework for clustering protein protein interaction networks Bioinformatics, July 1, 2007; 23(13): i29 - i40. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
A. Li and S. Horvath Network neighborhood analysis with the multi-node topological overlap measure Bioinformatics, January 15, 2007; 23(2): 222 - 231. [Abstract] [Full Text] [PDF]
|
|