Enumeration, conformation sampling and population of libraries of peptide macrocycles for the search of chemotherapeutic cardioprotection agents

Peptides are uniquely endowed with features that allow them to perturb previously difficult to drug biomolecular targets. Peptide macrocycles in particular have seen a flurry of recent interest due to their enhanced bioavailability, tunability and specificity. Although these properties make them attractive hit-candidates in early stage drug discovery, knowing which peptides to pursue is non‐trivial due to the magnitude of the peptide sequence space. Computational screening approaches show promise in their ability to address the size of this search space but suffer from their inability to accurately interrogate the conformational landscape of peptide macrocycles. We developed an in‐silico compound enumerator that was tasked with populating a conformationally laden peptide virtual library. This library was then used in the search for cardio‐protective agents (that may be administered, reducing tissue damage during reperfusion after ischemia (heart attacks)). Our enumerator successfully generated a library of 15.2 billion compounds, requiring the use of compression algorithms, conformational sampling protocols and management of aggregated compute resources in the context of a local cluster. In the absence of experimental biophysical data, we performed biased sampling during alchemical molecular dynamics simulations in order to observe cyclophilin‐D perturbation by cyclosporine A and its mitochondrial targeted analogue. Reliable intermediate state averaging through a WHAM analysis of the biased dynamic pulling simulations confirmed that the cardio‐protective activity of cyclosporine A was due to its mitochondrial targeting. Paralleltempered solution molecular dynamics in combination with efficient clustering isolated the essential dynamics of a cyclic peptide scaffold. The rapid enumeration of skeletons from these essential dynamics gave rise to a conformation laden virtual library of all the 15.2 Billion unique cyclic peptides (given the limits on peptide sequence imposed). Analysis of this library showed the exact extent of physicochemical properties covered, relative to the bare scaffold precursor. Molecular docking of a subset of the virtual library against cyclophilin‐D showed significant improvements in affinity to the target (relative to cyclosporine A). The conformation laden virtual library, accessed by our methodology, provided derivatives that were able to make many interactions per peptide with the cyclophilin‐D target. Machine learning methods showed promise in the training of Support Vector Machines for synthetic feasibility prediction for this library. The synergy between enumeration and conformational sampling greatly improves the performance of this library during virtual screening, even when only a subset is used

Data-Driven Rational Drug Design

Vast amount of experimental data in structural biology has been generated, collected and accumulated in the last few decades. This rich dataset is an invaluable mine of knowledge, from which deep insights can be obtained and practical applications can be developed. To achieve that goal, we must be able to manage such Big Data\u27\u27 in science and investigate them expertly. Molecular docking is a field that can prominently make use of the large structural biology dataset. As an important component of rational drug design, molecular docking is used to perform large-scale screening of putative associations between small organic molecules and their pharmacologically relevant protein targets. Given a small molecule (ligand), a molecular docking program simulates its interaction with the target protein, and reports the probable conformation of the protein-ligand complex, and the relative binding affinity compared against other candidate ligands. This dissertation collects my contributions in several aspects of molecular docking. My early contribution focused on developing a novel metric to quantify the structural similarity between two protein-ligand complexes. Benchmarks show that my metric addressed several issues associated with the conventional metric. Furthermore, I extended the functionality of this metric to cross different systems, effectively utilizing the data at the proteome level. After developing the novel metric, I formulated a scoring function that can extract the biological information of the complex, integrate it with the physics components, and finally enhance the performance. Through collaboration, I implemented my model into an ultra-fast, adaptive program, which can take advantage of a range of modern parallel architectures and handle the demanding data processing tasks in large scale molecular docking applications

Graphics Processing Unit Accelerated Coarse-Grained Protein-Protein Docking

Graphics processing unit (GPU) architectures are increasingly used for general purpose computing, providing the means to migrate algorithms from the SISD paradigm, synonymous with CPU architectures, to the SIMD paradigm. Generally programmable commodity multi-core hardware can result in significant speed-ups for migrated codes. Because of their computational complexity, molecular simulations in particular stand to benefit from GPU acceleration. Coarse-grained molecular models provide reduced complexity when compared to the traditional, computationally expensive, all-atom models. However, while coarse-grained models are much less computationally expensive than the all-atom approach, the pairwise energy calculations required at each iteration of the algorithm continue to cause a computational bottleneck for a serial implementation. In this work, we describe a GPU implementation of the Kim-Hummer coarse-grained model for protein docking simulations, using a Replica Exchange Monte-Carlo (REMC) method. Our highly parallel implementation vastly increases the size- and time scales accessible to molecular simulation. We describe in detail the complex process of migrating the algorithm to a GPU as well as the effect of various GPU approaches and optimisations on algorithm speed-up. Our benchmarking and profiling shows that the GPU implementation scales very favourably compared to a CPU implementation. Small reference simulations benefit from a modest speedup of between 4 to 10 times. However, large simulations, containing many thousands of residues, benefit from asynchronous GPU acceleration to a far greater degree and exhibit speed-ups of up to 1400 times. We demonstrate the utility of our system on some model problems. We investigate the effects of macromolecular crowding, using a repulsive crowder model, finding our results to agree with those predicted by scaled particle theory. We also perform initial studies into the simulation of viral capsids assembly, demonstrating the crude assembly of capsid pieces into a small fragment. This is the first implementation of REMC docking on a GPU, and the effectuate speed-ups alter the tractability of large scale simulations: simulations that otherwise require months or years can be performed in days or weeks using a GPU

Scheduling and Tuning Kernels for High-performance on Heterogeneous Processor Systems

Accelerated parallel computing techniques using devices such as GPUs and Xeon Phis (along with CPUs) have proposed promising solutions of extending the cutting edge of high-performance computer systems. A significant performance improvement can be achieved when suitable workloads are handled by the accelerator. Traditional CPUs can handle those workloads not well suited for accelerators. Combination of multiple types of processors in a single computer system is referred to as a heterogeneous system. This dissertation addresses tuning and scheduling issues in heterogeneous systems. The first section presents work on tuning scientific workloads on three different types of processors: multi-core CPU, Xeon Phi massively parallel processor, and NVIDIA GPU; common tuning methods and platform-specific tuning techniques are presented. Then, analysis is done to demonstrate the performance characteristics of the heterogeneous system on different input data. This section of the dissertation is part of the GeauxDock project, which prototyped a few state-of-art bioinformatics algorithms, and delivered a fast molecular docking program. The second section of this work studies the performance model of the GeauxDock computing kernel. Specifically, the work presents an extraction of features from the input data set and the target systems, and then uses various regression models to calculate the perspective computation time. This helps understand why a certain processor is faster for certain sets of tasks. It also provides the essential information for scheduling on heterogeneous systems. In addition, this dissertation investigates a high-level task scheduling framework for heterogeneous processor systems in which, the pros and cons of using different heterogeneous processors can complement each other. Thus a higher performance can be achieve on heterogeneous computing systems. A new scheduling algorithm with four innovations is presented: Ranked Opportunistic Balancing (ROB), Multi-subject Ranking (MR), Multi-subject Relative Ranking (MRR), and Automatic Small Tasks Rearranging (ASTR). The new algorithm consistently outperforms previously proposed algorithms with better scheduling results, lower computational complexity, and more consistent results over a range of performance prediction errors. Finally, this work extends the heterogeneous task scheduling algorithm to handle power capping feature. It demonstrates that a power-aware scheduler significantly improves the power efficiencies and saves the energy consumption. This suggests that, in addition to performance benefits, heterogeneous systems may have certain advantages on overall power efficiency

Molecular simulations and binding free energy calculations for drug discovery

Early stage drug discovery would change dramatically if computational methods could accurately and quickly predict binding modes and affinities of compounds in advance of experiments. Simulation based approaches like classical molecular dynamics (MD) simulations have gained traction as a useful tool for early stage drug discovery, as MD provides a full atomistic and dynamic view of the biological system of interest. In principle, MD simulations can be a powerful tool for lead optimization as MD can provide knowledge of the ligand's binding mode, dynamics, and even binding affinity. In order to accurately compute binding affinities or predict ligand binding modes, simulations must run long enough to capture the relevant biological event or sufficiently sample all the physically relevant conformations. My research presents the development of new simulation approaches for accelerated sampling and demonstrates the use of non-equilibrium candidate Monte Carlo moves with MD simulations for predicting ligand binding modes to a pharmaceutically relevant target

Understanding and design of molecular dynamics based simulation methods.

Several new strategies for employing modified molecular dynamics (MD) protocols for finding energy minima were developed developed. First, we derived a new method of searching for the lowest energy conformation by employ employing the results of our work to explain "mean mean-field" molecular dynamics simulation methods. Called ensembles extracted by atomic coordinate transformations (EXACT), the method allows simulations to be performed with a variable degree of approximation. Then, we examine the previously published locally enhanced sampling (LES) approximation. The method makes copies of a small part of interest in a larger system, and allows the dynamics to unfold. The method works by making the copies invisible to each other and allowing them to interact only with the remainder of the system, called the bath. The bath, on the other hand, interacts with an averaged representation of the copied part. This averaged interaction allows the copied particles to move into geometries they might not visit in a conventional MD simulation, which allows a greater variety of structures to be sampled. We derive the algorithm by copying the entire system, and then by employing holonomic constraints between the bath particles between the various systems. Using this new approach, we explore several issues previously noted in the literature. We also use the EXACT approximation method to illustrate the nature of the LES approximation. Finally, we present another optimization method, which add adds pressure along with temperature in analogue with simulated annealing. The method is tested against simulated annealing for condensed phase systems of argon, monoglyme, and tetraglyme. The method noticeably improves the results for the glyme systems, but does not seem to hurt the results for the argon system

An enhanced-sampling MD-based protocol for molecular docking

Understanding molecular recognition of small molecules by proteins in atomistic detail is key for drug design. Molecular docking is a widely used computational method to mimic ligand-protein association in silico. However, predicting conformational changes occurring in proteins upon ligand binding is still a major challenge. Ensemble docking approaches address this issue by considering a set of different conformations of the protein obtained either experimentally or from computer simulations, e.g. from molecular dynamics. However, holo structures prone to host (the correct) ligands are generally poorly sampled by standard molecular dynamics simulations of the unbound (apo) protein. In order to address this limitation, we introduce a computational approach based on metadynamics simulations called ensemble docking with enhanced sampling of pocket shape (EDES) that allows holo-like conformations of proteins to be generated by exploiting only their apo structures. This is achieved by defining a set of collective variables able to sample different shapes of the binding site, ultimately mimicking the steric effect due to the ligand. In this work, we assessed the method on re-docking and cross-docking calculations. In first case, we selected three different protein targets undergoing different extent of conformational changes upon binding and, for each of them, we docked the experimental ligand conformation into an ensemble of receptor structures generated by EDES. In the second case, in the contest of a blind docking challenge, we generated the 3D structures of a set of different ligands of the same receptor and docked them into a set of EDES-generated conformations of that receptor. In all cases, for both re-docking and cross-docking experiments, our protocol generates a significant fraction of structures featuring a low RMSD from the experimental holo geometry of the receptor. Moreover, ensemble docking calculations using those conformations yielded in almost all cases to native-like poses among the top-ranked ones. Finally, we also tested an improved EDES recipe on a further target, known to be extremely challenging due to its extended binding region and the large extent of conformational changes accompanying the binding of its ligands