title: Triangle network motifs predict complexes by complementing high-error interactomes with structural information.
abstract: BACKGROUND
  A lot of high-throughput studies produce protein-protein interaction networks (PPINs) with many errors and missing information. Even for genome-wide approaches, there is often a low overlap between PPINs produced by different studies. Second-level neighbors separated by two protein-protein interactions (PPIs) were previously used for predicting protein function and finding complexes in high-error PPINs. We retrieve second level neighbors in PPINs, and complement these with structural domain-domain interactions (SDDIs) representing binding evidence on proteins, forming PPI-SDDI-PPI triangles.
  
  
  RESULTS
  We find low overlap between PPINs, SDDIs and known complexes, all well below 10%. We evaluate the overlap of PPI-SDDI-PPI triangles with known complexes from Munich Information center for Protein Sequences (MIPS). PPI-SDDI-PPI triangles have ~20 times higher overlap with MIPS complexes than using second-level neighbors in PPINs without SDDIs. The biological interpretation for triangles is that a SDDI causes two proteins to be observed with common interaction partners in high-throughput experiments. The relatively few SDDIs overlapping with PPINs are part of highly connected SDDI components, and are more likely to be detected in experimental studies. We demonstrate the utility of PPI-SDDI-PPI triangles by reconstructing myosin-actin processes in the nucleus, cytoplasm, and cytoskeleton, which were not obvious in the original PPIN. Using other complementary datatypes in place of SDDIs to form triangles, such as PubMed co-occurrences or threading information, results in a similar ability to find protein complexes.
  
  
  CONCLUSIONS
  Given high-error PPINs with missing information, triangles of mixed datatypes are a promising direction for finding protein complexes. Integrating PPINs with SDDIs improves finding complexes. Structural SDDIs partially explain the high functional similarity of second-level neighbors in PPINs. We estimate that relatively little structural information would be sufficient for finding complexes involving most of the proteins and interactions in a typical PPIN.
authors: Biotechnology Center (BIOTEC), Technische Universität Dresden, 01307 Dresden, Germany. williama@biotec.tu-dresden.de
authors: Bill
authors: B
authors: Andreopoulos
authors: Christof
authors: C
authors: Winter
authors: Dirk
authors: D
authors: Labudde
authors: Michael
authors: M
authors: Schroeder
mesh_terms: D001665:Binding Sites; D019295:Computational Biology / Q000379:methods*; D030562:Databases, Protein; D025941:Protein Interaction Mapping / Q000379:methods*; D011506:Proteins / Q000737:chemistry* / Q000378:metabolism
chemical_list: D011506:Proteins