title: Constructing a robust protein-protein interaction network by integrating multiple public databases.
abstract: BACKGROUND
  Protein-protein interactions (PPIs) are a critical component for many underlying biological processes. A PPI network can provide insight into the mechanisms of these processes, as well as the relationships among different proteins and toxicants that are potentially involved in the processes. There are many PPI databases publicly available, each with a specific focus. The challenge is how to effectively combine their contents to generate a robust and biologically relevant PPI network.
  
  
  METHODS
  In this study, seven public PPI databases, BioGRID, DIP, HPRD, IntAct, MINT, REACTOME, and SPIKE, were used to explore a powerful approach to combine multiple PPI databases for an integrated PPI network. We developed a novel method called k-votes to create seven different integrated networks by using values of k ranging from 1-7. Functional modules were mined by using SCAN, a Structural Clustering Algorithm for Networks. Overall module qualities were evaluated for each integrated network using the following statistical and biological measures: (1) modularity, (2) similarity-based modularity, (3) clustering score, and (4) enrichment.
  
  
  RESULTS
  Each integrated human PPI network was constructed based on the number of votes (k) for a particular interaction from the committee of the original seven PPI databases. The performance of functional modules obtained by SCAN from each integrated network was evaluated. The optimal value for k was determined by the functional module analysis. Our results demonstrate that the k-votes method outperforms the traditional union approach in terms of both statistical significance and biological meaning. The best network is achieved at k = 2, which is composed of interactions that are confirmed in at least two PPI databases. In contrast, the traditional union approach yields an integrated network that consists of all interactions of seven PPI databases, which might be subject to high false positives.
  
  
  CONCLUSIONS
  We determined that the k-votes method for constructing a robust PPI network by integrating multiple public databases outperforms previously reported approaches and that a value of k=2 provides the best results. The developed strategies for combining databases show promise in the advancement of network construction and modeling.
authors.affiliation: Department of Information Science, University of Arkansas at Little Rock, 2801 S, University Ave, Little Rock, AR 72204-1099, USA.
authors.forename: Venkata-Swamy
authors.initials: VS
authors.lastname: Martha
authors.forename: Zhichao
authors.initials: Z
authors.lastname: Liu
authors.forename: Li
authors.initials: L
authors.lastname: Guo
authors.forename: Zhenqiang
authors.initials: Z
authors.lastname: Su
authors.forename: Yanbin
authors.initials: Y
authors.lastname: Ye
authors.forename: Hong
authors.initials: H
authors.lastname: Fang
authors.forename: Don
authors.initials: D
authors.lastname: Ding
authors.forename: Weida
authors.initials: W
authors.lastname: Tong
authors.forename: Xiaowei
authors.initials: X
authors.lastname: Xu
mesh_terms: D000465:Algorithms; D030562:Databases, Protein; D006801:Humans; D008954:Models, Biological; D025941:Protein Interaction Mapping / Q000379:methods; D060066:Protein Interaction Maps; D011506:Proteins / Q000737:chemistry / Q000378:metabolism
chemical_list: D011506:Proteins