An efficient algorithm to perform local concerted movements of a chain molecule

PLoS One. 2015 Mar 31;10(3):e0118342. doi: 10.1371/journal.pone.0118342. eCollection 2015.

Abstract

The devising of efficient concerted rotation moves that modify only selected local portions of chain molecules is a long studied problem. Possible applications range from speeding the uncorrelated sampling of polymeric dense systems to loop reconstruction and structure refinement in protein modeling. Here, we propose and validate, on a few pedagogical examples, a novel numerical strategy that generalizes the notion of concerted rotation. The usage of the Denavit-Hartenberg parameters for chain description allows all possible choices for the subset of degrees of freedom to be modified in the move. They can be arbitrarily distributed along the chain and can be distanced between consecutive monomers as well. The efficiency of the methodology capitalizes on the inherent geometrical structure of the manifold defined by all chain configurations compatible with the fixed degrees of freedom. The chain portion to be moved is first opened along a direction chosen in the tangent space to the manifold, and then closed in the orthogonal space. As a consequence, in Monte Carlo simulations detailed balance is easily enforced without the need of using Jacobian reweighting. Moreover, the relative fluctuations of the degrees of freedom involved in the move can be easily tuned. We show different applications: the manifold of possible configurations is explored in a very efficient way for a protein fragment and for a cyclic molecule; the "local backbone volume", related to the volume spanned by the manifold, reproduces the mobility profile of all-α helical proteins; the refinement of small protein fragments with different secondary structures is addressed. The presented results suggest our methodology as a valuable exploration and sampling tool in the context of bio-molecular simulations.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms*
  • Models, Theoretical*

Grants and funding

SZ, AR, FS, AT acknowledge financial support from AIRC (Associazione Italiana per la Ricerca sul Cancro, URL www.airc.it) through the grant AIRC 5 per mille, Rif. 12214. AR acknowledges financial support from MIUR (Ministero Istruzione Universita’ Ricerca) through Fondo per gli Investimenti della Ricerca di Base-Accordo di Programma, Rif. RBAP11ETKA (URL firb.miur.it). FS acknowledges financial support from MIUR (Ministero Istruzione Universita’ Ricerca) through Programmi di Ricerca Scientifica di Rilevante Interesse Nazionale, Rif. 2012NNRKAF (URL prin.miur.it). SZ and AT acknowledge financial support from the University of Padua (Universita’ degli Studi di Padova, URL www.unipd.it) through Progetto di Ateneo CPDA121890. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.