Docking without docking: ISEARCH—prediction of interactions using known interfaces

Abstract

The increasing number of solved protein structures provides a solid number of interfaces, if protein-protein interactions, domain-domain contacts, and contacts between biological units are taken into account. An interface library gives us the opportunity to identify surface regions on a target molecule that are similar by local structure and residue composition. If both unbound components of a possible protein complex exhibit structural similarities to a known interface, the unbound structures can be superposed onto the known interfaces. The approach is accompanied by two mathematical problems. Protein surfaces have to be quickly screened by thousands of patches, and similarity has to be evaluated by a suitable scoring scheme. The used algorithm (NeedleHaystack) identifies similar patches within minutes. Structurally related sites are recognized even if only parts of the template patches are structurally related to the interface region. A successful prediction of the protein complex depends on a suitable template of the library. However, the performed tests indicate that interaction sites are identified even if the similarity is very low. The approach complements existing ab initio methods and provides valuable results on standard benchmark sets.