A Combinatorial Approach to Protein Docking with Flexible Side Chains

Rigid-body docking approaches are not sufficient to predict the structure of a protein complex from the unbound (native) structures of the two proteins. Accounting for side chain flexibility is an important step towards fully flexible protein docking. This work describes an approach that allows conformational flexibility for the side chains while keeping the protein backbone rigid. Starting from candidates created by a rigid-docking algorithm, we demangle the side chains of the docking site, thus creating reasonable approximations of the true complex structure. These structures are ranked with respect to the binding free energy. We present two new techniques for side chain demangling. Both approaches are based on a discrete representation of the side chain conformational space by the use of a rotamer library. This leads to a combinatorial optimization problem. For the solution of this problem, we propose a fast heuristic approach and an exact, albeit slower, method that uses branch-and-cut techniques. As a test set, we use the unbound structures of three proteases and the corresponding protein inhibitors. For each of the examples, the highest-ranking conformation produced was a good approximation of the true complex structure.

[1]  M J Sternberg,et al.  New algorithm to model protein-protein recognition based on surface complementarity. Applications to antibody-antigen docking. , 1992, Journal of molecular biology.

[2]  W. Howe,et al.  Computer design of bioactive molecules: A method for receptor‐based de novo ligand design , 1991, Proteins.

[3]  S Vajda,et al.  Prediction of protein complexes using empirical free energy functions , 1996, Protein science : a publication of the Protein Society.

[4]  P. Koehl,et al.  Application of a self-consistent mean field theory to predict protein side-chains conformation and estimate their conformational entropy. , 1994, Journal of molecular biology.

[5]  Thomas Lengauer,et al.  A fast flexible docking method using an incremental construction algorithm. , 1996, Journal of molecular biology.

[6]  J. Ponder,et al.  Tertiary templates for proteins. Use of packing criteria in the enumeration of allowed sequences for different structural classes. , 1987, Journal of molecular biology.

[7]  R. Abagyan,et al.  Biased probability Monte Carlo conformational searches and electrostatic calculations for peptides and proteins. , 1994, Journal of molecular biology.

[8]  M J Sternberg,et al.  A continuum model for protein-protein interactions: application to the docking problem. , 1995, Journal of molecular biology.

[9]  Hans-Peter Lenhof,et al.  New contact measures for the protein docking problem , 1997, RECOMB '97.

[10]  A Tramontano,et al.  PUZZLE: a new method for automated protein docking based on surface shape complementarity. , 1994, Journal of molecular biology.

[11]  J. Janin,et al.  Protein‐protein recognition analyzed by docking simulation , 1991, Proteins.

[12]  K. Sharp,et al.  Accurate Calculation of Hydration Free Energies Using Macroscopic Solvent Models , 1994 .

[13]  I. Kuntz,et al.  Protein docking and complementarity. , 1991, Journal of molecular biology.

[14]  M. L. Connolly Shape complementarity at the hemoglobin α1β1 subunit interface , 1986 .

[15]  A. Leach,et al.  Ligand docking to proteins with discrete side-chain flexibility. , 1994, Journal of molecular biology.

[16]  P. Kollman,et al.  A Second Generation Force Field for the Simulation of Proteins, Nucleic Acids, and Organic Molecules , 1995 .

[17]  D. Schomburg,et al.  Hydrogen bonding and molecular surface shape complementarity as a basis for protein docking. , 1996, Journal of molecular biology.

[18]  G J Williams,et al.  The Protein Data Bank: a computer-based archival file for macromolecular structures. , 1977, Journal of molecular biology.

[19]  Roland L. Dunbrack,et al.  Bayesian statistical analysis of protein side‐chain rotamer preferences , 1997, Protein science : a publication of the Protein Society.

[20]  Johan Desmet,et al.  The dead-end elimination theorem and its use in protein side-chain positioning , 1992, Nature.

[21]  C. Sander,et al.  Fast and simple monte carlo algorithm for side chain optimization in proteins: Application to model building by homology , 1992, Proteins.

[22]  Robert E. Bruccoleri,et al.  Antibody modeling using the conformational search program CONGEN , 1992 .

[23]  Ruben Abagyan,et al.  Detailed ab initio prediction of lysozyme–antibody complex with 1.6 Å accuracy , 1994, Nature Structural Biology.

[24]  S. Kim,et al.  "Soft docking": matching of molecular surface cubes. , 1991, Journal of molecular biology.

[25]  J Moult,et al.  Docking by least-squares fitting of molecular surface patterns. , 1992, Journal of molecular biology.

[26]  M. Sternberg,et al.  Rapid refinement of protein interfaces incorporating solvation: application to the docking problem. , 1998, Journal of molecular biology.

[27]  C. Laughton,et al.  Prediction of protein side-chain conformations from local three-dimensional homology relationships. , 1994, Journal of molecular biology.

[28]  A R Leach,et al.  Exploring the conformational space of protein side chains using dead‐end elimination and the A* algorithm , 1998, Proteins.

[29]  E. Katchalski‐Katzir,et al.  Molecular surface recognition: determination of geometric fit between proteins and their ligands by correlation techniques. , 1992, Proceedings of the National Academy of Sciences of the United States of America.