Efficient Algorithms to Explore Conformation Spaces of Flexible Protein Loops

Several applications in biology - e.g., incorporation of protein flexibility in ligand docking algorithms, interpretation of fuzzy X-ray crystallographic data, and homology modeling - require computing the internal parameters of a flexible fragment (usually, a loop) of a protein in order to connect its termini to the rest of the protein without causing any steric clash. One must often sample many such conformations in order to explore and adequately represent the conformational range of the studied loop. While sampling must be fast, it is made difficult by the fact that two conflicting constraints - kinematic closure and clash avoidance - must be satisfied concurrently. This paper describes two efficient and complementary sampling algorithms to explore the space of closed clash-free conformations of a flexible protein loop. The "seed sampling" algorithm samples broadly from this space, while the "deformation sampling" algorithm uses seed conformations as starting points to explore the conformation space around them at a finer grain. Computational results are presented for various loops ranging from 5 to 25 residues. More specific results also show that the combination of the sampling algorithms with a functional site prediction software (FEATURE) makes it possible to compute and recognize calcium-binding loop conformations. The sampling algorithms are implemented in a toolkit (LoopTK), which is available at https://simtk.org/home/looptk.

[1]  Russ B. Altman,et al.  Combining Molecular Dynamics and Machine Learning to Improve Protein Function Recognition , 2007, Pacific Symposium on Biocomputing.

[2]  M. Cygler,et al.  Structure of Ca(2+)-loaded human grancalcin. , 2001, Acta crystallographica. Section D, Biological crystallography.

[3]  Harold A. Scheraga,et al.  Exact analytical loop closure in proteins using polynomial equations , 1999, J. Comput. Chem..

[4]  B. Honig,et al.  A hierarchical approach to all‐atom protein loop prediction , 2004, Proteins.

[5]  C. Deane,et al.  A novel exhaustive search algorithm for predicting the conformation of polypeptide segments in proteins , 2000, Proteins.

[6]  Chaok Seok,et al.  A kinematic view of loop closure , 2004, J. Comput. Chem..

[7]  Oussama Khatib,et al.  Operational space dynamics: efficient algorithms for modeling and control of branching mechanisms , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[8]  Mark H. Overmars,et al.  Spheres, molecules, and hidden surface removal , 1994, SCG '94.

[9]  Pedro Alexandrino Fernandes,et al.  Protein–ligand docking: Current status and future challenges , 2006, Proteins.

[10]  L. Kavraki,et al.  Modeling protein conformational ensembles: From missing loops to equilibrium fluctuations , 2006, Proteins.

[11]  Leonidas J. Guibas,et al.  Inverse Kinematics in Biology: The Protein Loop Closure Problem , 2005, Int. J. Robotics Res..

[12]  H. Kawasaki,et al.  Calcium-binding proteins. 1: EF-hands. , 1994, Protein profile.

[13]  Adrian A Canutescu,et al.  Cyclic coordinate descent: A robotics algorithm for protein loop closure , 2003, Protein science : a publication of the Protein Society.

[14]  M. DePristo,et al.  Is one solution good enough? , 2006, Nature Structural &Molecular Biology.

[15]  J. Onuchic,et al.  Multiple-basin energy landscapes for large-amplitude conformational motions of proteins: Structure-based molecular dynamics simulations , 2006, Proceedings of the National Academy of Sciences.

[16]  M. DePristo,et al.  Ab initio construction of polypeptide fragments: Efficient generation of accurate, representative ensembles , 2003, Proteins.

[17]  Itay Lotan,et al.  Real-space protein-model completion: an inverse-kinematics approach. , 2005, Acta crystallographica. Section D, Biological crystallography.

[18]  R. Altman,et al.  Recognizing protein binding sites using statistical descriptions of their 3D environments. , 1998, Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing.

[19]  Adrian A Canutescu,et al.  Access the most recent version at doi: 10.1110/ps.03154503 References , 2003 .

[20]  George N Phillips,et al.  Ensemble refinement of protein crystal structures: validation and application. , 2007, Structure.

[21]  M. Karplus,et al.  Conformational sampling using high‐temperature molecular dynamics , 1990, Biopolymers.

[22]  A. Sali,et al.  Modeling of loops in protein structures , 2000, Protein science : a publication of the Protein Society.

[23]  M. DePristo,et al.  Ab initio construction of polypeptide fragments: Accuracy of loop decoy discrimination by an all‐atom statistical potential and the AMBER force field with the Generalized Born solvation model , 2003, Proteins.

[24]  H. Bosshard,et al.  Molecular recognition by induced fit: how fit is the concept? , 2001, News in physiological sciences : an international journal of physiology produced jointly by the International Union of Physiological Sciences and the American Physiological Society.

[25]  G. Phillips,et al.  Metal-ion affinity and specificity in EF-hand proteins: coordination geometry and domain plasticity in parvalbumin. , 1999, Structure.

[26]  Roland L. Dunbrack,et al.  Genomic Fold Assignment and Rational Modeling of Proteins of Biological Interest , 2000, ISMB.

[27]  Eckart Bindewald,et al.  A divide and conquer approach to fast loop modeling. , 2002, Protein engineering.

[28]  V. Sobolev,et al.  Flexibility of metal binding sites in proteins on a database scale , 2005, Proteins.

[29]  M. Karplus,et al.  PDB-based protein loop prediction: parameters for selection and methods for optimization. , 1997, Journal of molecular biology.

[30]  Thierry Siméon,et al.  Geometric algorithms for the conformational analysis of long protein loops , 2004, J. Comput. Chem..