title: Detection of protein complexes from affinity purification/mass spectrometry data.
abstract: BACKGROUND
  Recent advances in molecular biology have led to the accumulation of large amounts of data on protein-protein interaction networks in different species. An important challenge for the analysis of these data is to extract functional modules such as protein complexes and biological processes from networks which are characterised by the present of a significant number of false positives. Various computational techniques have been applied in recent years. However, most of them treat protein interaction as binary. Co-complex relations derived from affinity purification/mass spectrometry (AP-MS) experiments have been largely ignored.
  
  
  METHODS
  This paper presents a new algorithm for detecting protein complexes from AP-MS data. The algorithm intends to detect groups of prey proteins that are significantly co-associated with the same set of bait proteins. We first construct AP-MS data as a bipartite network, where one set of nodes consists of bait proteins and the other set is composed of prey proteins. We then calculate pair-wise similarities of bait proteins based on the number of their commonly shared neighbours. A hierarchical clustering algorithm is employed to cluster bait proteins based on the similarities and thus a set of 'seed' clusters is obtained. Starting from these 'seed' clusters, an expansion process is developed to identify prey proteins which are significantly associated with the same set of bait proteins. Then, a set of complete protein complexes is derived. In application to two real AP-MS datasets, we validate biological significance of predicted protein complexes by using curated protein complexes and well-characterized cellular component annotation from Gene Ontology (GO). Several statistical metrics have been applied for evaluation.
  
  
  RESULTS
  Experimental results show that, the proposed algorithm achieves significant improvement in detecting protein complexes from AP-MS data. In comparison to the well-known MCL algorithm, our algorithm improves the accuracy rate by about 20% in detecting protein complexes in both networks and increases the F-Measure value by about 50% in Krogan_2006 network. Greater precision and better accuracy have been achieved and the identified complexes are demonstrated to match well with existing curated protein complexes.
  
  
  CONCLUSIONS
  Our study highlights the significance of taking co-complex relations into account when extracting protein complexes from AP-MS data. The algorithm proposed in this paper can be easily extended to the analysis of other biological networks which can be conveniently represented by bipartite graphs such as drug-target networks.
authors.affiliation: School of Computing and Mathematics, Computer Sciences Research Institute, University of Ulster, N. Ireland, BT37 0QB, UK.
authors.forename: Bingjing
authors.initials: B
authors.lastname: Cai
authors.forename: Haiying
authors.initials: H
authors.lastname: Wang
authors.forename: Huiru
authors.initials: H
authors.lastname: Zheng
authors.forename: Hui
authors.initials: H
authors.lastname: Wang
mesh_terms: D000465:Algorithms; D002846:Chromatography, Affinity / Q000379:methods*; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods; D030562:Databases, Protein; D005069:Evaluation Studies as Topic; D013058:Mass Spectrometry / Q000379:methods*; D011506:Proteins / Q000032:analysis* / Q000737:chemistry*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity
chemical_list: D011506:Proteins