First-principles molecular structure search with a genetic algorithm

The identification of low-energy conformers for a given molecule is a fundamental problem in computational chemistry and cheminformatics. We assess here a conformer search that employs a genetic algorithm for sampling the low-energy segment of the conformation space of molecules. The algorithm is designed to work with first-principles methods, facilitated by the incorporation of local optimization and blacklisting conformers to prevent repeated evaluations of very similar solutions. The aim of the search is not only to find the global minimum, but to predict all conformers within an energy window above the global minimum. The performance of the search strategy is: (i) evaluated for a reference data set extracted from a database with amino acid dipeptide conformers obtained by an extensive combined force field and first-principles search and (ii) compared to the performance of a systematic search and a random conformer generator for the example of a drug-like ligand with 43 atoms, 8 rotatable bonds and 1 cis/trans bond

Mechanistic insight into ligand binding to G-quadruplex DNA

Specific guanine-rich regions in human genome can form higher-order DNA structures called G-quadruplexes, which regulate many relevant biological processes. For instance, the formation of G-quadruplex at telomeres can alter cellular functions, inducing apoptosis. Thus, developing small molecules that are able to bind and stabilize the telomeric G-quadruplexes represents an attractive strategy for antitumor therapy. An example is 3-(benzo[d]thiazol-2-yl)-7-hydroxy-8-((4-(2-hydroxyethyl)piperazin-1-yl)methyl)-2H-chromen-2-one (compound 1), recently identified as potent ligand of the G-quadruplex [d(TGGGGT)]4 with promising in vitro antitumor activity. The experimental observations are suggestive of a complex binding mechanism that, despite efforts, has defied full characterization. Here, we provide through metadynamics simulations a comprehensive understanding of the binding mechanism of 1 to the G-quadruplex [d(TGGGGT)]4. In our calculations, the ligand explores all the available binding sites on the DNA structure and the free-energy landscape of the whole binding process is computed. We have thus disclosed a peculiar hopping binding mechanism whereas 1 is able to bind both to the groove and to the 3' end of the G-quadruplex. Our results fully explain the available experimental data, rendering our approach of great value for further ligand/DNA studie

An in silico approach to the ß-defensin structure-activity problem

ß-defensins are a family of cationic, cysteine-rich antimicrobial peptide (AMP) components of the innate immune response to infection. They are expressed both inducibly and constitutively within vertebrates, insects and plants and antimicrobial action is observed against (both gram positive and gram negative) bacteria and a subset of enveloped viruses. The antimicrobial phenomenon is thought to result from membrane permeablisation that depends on key, electrostatic binding events between defensin and pathogen cell surface. This thesis tackles, in silico, two components of this structure-activity problem: That of rationally predicting ß-defensin structure, and that of elucidating the first (presumed) binding events between ß-defensin and pathogen cell surface. Preliminary results suggest that successful in silico folding requires a mobile disulphide bond strategy to circumvent kinetic trapping of intermediate states, and that the mechanism of pathogenic binding involves a complex interplay of hydrogen bonding, as well as productive electrostatic interactions

Chasing Funnels on Protein-Protein Energy Landscapes at Different Resolutions

This is the published version, also available here: http://dx.doi.org/10.1529/biophysj.108.132977.Studies of intermolecular energy landscapes are important for understanding protein association and adequate modeling of protein interactions. Landscape representation at different resolutions can be used for the refinement of docking predictions and detection of macro characteristics, like the binding funnel. A representative set of protein-protein complexes was used to systematically map the intermolecular landscape by grid-based docking. The change of the resolution was achieved by varying the range of the potential, according to the variable resolution GRAMM methodology. A formalism was developed to consistently parameterize the potential and describe essential characteristics of the landscape. The results of gradual landscape smoothing, from high to low resolution, indicate that i), the number of energy basins, the landscape ruggedness, and the slope decrease accordingly; ii), the number of near-native matches, defined as those inside the funnel, increases until the trend breaks down at critical resolution; the rate of the increase and the critical resolution are specific to the type of a complex (enzyme inhibitor, antigen-antibody, and other), reflect known underlying recognition factors, and correlate with earlier determined estimates of the funnel size; iii), the native/nonnative energy gap, a major characteristic of the energy minima hierarchy, remains constant; and iv), the putative funnel (defined as the deepest basin) has the largest average depth-related ruggedness and slope, at all resolutions. The results facilitate better understanding of the binding landscapes and suggest directions for implementation in practical docking protocols

Self-learning Multiscale Simulation for Achieving High Accuracy and High Efficiency Simultaneously

We propose a new multi-scale molecular dynamics simulation method which can achieve high accuracy and high sampling efficiency simultaneously without aforehand knowledge of the coarse grained (CG) potential and test it for a biomolecular system. Based on the resolution exchange simulations between atomistic and CG replicas, a self-learning strategy is introduced to progressively improve the CG potential by an iterative way. Two tests show that, the new method can rapidly improve the CG potential and achieve efficient sampling even starting from an unrealistic CG potential. The resulting free energy agreed well with exact result and the convergence by the method was much faster than that by the replica exchange method. The method is generic and can be applied to many biological as well as non-biological problems.Comment: 14 pages, 6 figure

A self-learning algorithm for biased molecular dynamics

A new self-learning algorithm for accelerated dynamics, reconnaissance metadynamics, is proposed that is able to work with a very large number of collective coordinates. Acceleration of the dynamics is achieved by constructing a bias potential in terms of a patchwork of one-dimensional, locally valid collective coordinates. These collective coordinates are obtained from trajectory analyses so that they adapt to any new features encountered during the simulation. We show how this methodology can be used to enhance sampling in real chemical systems citing examples both from the physics of clusters and from the biological sciences.Comment: 6 pages, 5 figures + 9 pages of supplementary informatio

Evolutionary-inspired probabilistic search for enhancing sampling of local minima in the protein energy surface

<p>Abstract</p> <p>Background</p> <p>Despite computational challenges, elucidating conformations that a protein system assumes under physiologic conditions for the purpose of biological activity is a central problem in computational structural biology. While these conformations are associated with low energies in the energy surface that underlies the protein conformational space, few existing conformational search algorithms focus on explicitly sampling low-energy local minima in the protein energy surface.</p> <p>Methods</p> <p>This work proposes a novel probabilistic search framework, PLOW, that explicitly samples low-energy local minima in the protein energy surface. The framework combines algorithmic ingredients from evolutionary computation and computational structural biology to effectively explore the subspace of local minima. A greedy local search maps a conformation sampled in conformational space to a nearby local minimum. A perturbation move jumps out of a local minimum to obtain a new starting conformation for the greedy local search. The process repeats in an iterative fashion, resulting in a trajectory-based exploration of the subspace of local minima.</p> <p>Results and conclusions</p> <p>The analysis of PLOW's performance shows that, by navigating only the subspace of local minima, PLOW is able to sample conformations near a protein's native structure, either more effectively or as well as state-of-the-art methods that focus on reproducing the native structure for a protein system. Analysis of the actual subspace of local minima shows that PLOW samples this subspace more effectively that a naive sampling approach. Additional theoretical analysis reveals that the perturbation function employed by PLOW is key to its ability to sample a diverse set of low-energy conformations. This analysis also suggests directions for further research and novel applications for the proposed framework.</p

Studying protein-ligand interactions using a Monte Carlo procedure

[eng] Biomolecular simulations have been widely used in the study of protein-ligand interactions; comprehending the mechanisms involved in the prediction of binding affinities would have a significant repercussion in the pharmaceutical industry. Notwithstanding the intrinsic difficulty of sampling the phase space, hardware and methodological developments make computer simulations a promising candidate in the resolution of biophysically relevant problems. In this context, the objective of the thesis is the development of a protocol that permits studying protein-ligand interactions, in view to be applied in drug discovery pipelines. The author contributed to the rewriting PELE, our Monte Carlo sampling procedure, using good practices of software development. These involved testing, improving the readability, modularity, encapsulation, maintenance and version control, just to name a few. Importantly, the recoding resulted in a competitive cutting-edge software that is able to integrate new algorithms and platforms, such as new force fields or a graphical user interface, while being reliable and efficient. The rest of the thesis is built upon this development. At this point, we established a protocol of unbiased all-atom simulations using PELE, often combined with Markov (state) Models (MSM) to characterize the energy landscape exploration. In the thesis, we have shown that PELE is a suitable tool to map complex mechanisms in an accurate and efficient manner. For example, we successfully conducted studies of ligand migration in prolyl oligopeptidases and nuclear hormone receptors (NHRs). Using PELE, we could map the ligand migration and binding pathway in such complex systems in less than 48 hours. On the other hand, with this technique we often run batches of 100s of simulations to reduce the wall-clock time. MSM is a useful technique to join these independent simulations in a unique statistical model, as individual trajectories only need to characterize the energy landscape locally, and the global characterization can be extracted from the model. We successfully applied the combination of these two methodologies to quantify binding mechanisms and estimate the binding free energy in systems involving NHRs and tyorsinases. However, this technique represents a significant computational effort. To reduce the computational load, we developed a new methodology to overcome the sampling limitations caused by the ruggedness of the energy landscape. In particular, we used a procedure of iterative simulations with adaptive spawning points based on reinforcement learning ideas. This permits sampling binding mechanisms at a fraction of the cost, and represents a speedup of an order of magnitude in complex systems. Importantly, we show in a proof-of-concept that it can be used to estimate absolute binding free energies. Overall, we hope that the methodologies presented herein help streamline the drug design process.[spa] Las simulaciones biomoleculares se han usado ampliamente en el estudio de interacciones proteína-ligando. Comprender los mecanismos involucrados en la predicción de afinidades de unión tiene una gran repercusión en la industria farmacéutica. A pesar de las dificultades intrínsecas en el muestreo del espacio de fases, mejoras de hardware y metodológicas hacen de las simulaciones por ordenador un candidato prometedor en la resolución de problemas biofísicos con alta relevancia. En este contexto, el objetivo de la tesis es el desarrollo de un protocolo que introduce un estudio más eficiente de las interacciones proteína-ligando, con vistas a diseminar PELE, un procedimiento de muestreo de Monte Carlo, en el diseño de fármacos. Nuestro principal foco ha sido sobrepasar las limitaciones de muestreo causadas por la rugosidad del paisaje de energías, aplicando nuestro protocolo para hacer analsis detallados a nivel atomístico en receptores nucleares de hormonas, receptores acoplados a proteínas G, tirosinasas y prolil oligopeptidasas, en colaboración con una compañía farmacéutica y de varios laboratorios experimentales. Con todo ello, esperamos que las metodologías presentadas en esta tesis ayuden a mejorar el diseño de fármacos