Abstract

The transport of water through aquaporins is a dynamic process that involves rapid movement of a chain of water molecules through the pore of the aquaporin. Structures of aquaporins solved using X-ray crystallography have provided some insights into how water is transported through these channels, and how certain structural features of the pore might help exclude other solutes from passing through the pore. However, such techniques provide only a static picture, and a dynamic picture of the transport and selectivity mechanism at work in aquaporins is possible with molecular dynamics (MD) simulations. In MD simulations, the forces between the different atoms in a system are computed, and the atoms are then allowed to move under the influence of these forces. This allows the sampling of different conformations of the molecule being studied, including conformations that are crucial in driving biological phenomena like water transport. Simulation studies have provided insights into a number of aspects of aquaporins, including the role of the asparagine-proline-alanine (NPA) motif and the aromatic/arginine (ar/R) constriction, water transport mechanism, mechanisms defining the selectivity of the channel, interaction with lipids, response to external electric field, and binding of putative drug molecules. This chapter provides a brief review of the current status of computational modeling of aquaporins using MD simulations. Initially, a brief account of force fields and MD simulations is presented followed by an account of how MD simulations have contributed to further our understanding of different aspects of aquaporins.

Abstract

The optical activity of a metal nanocluster (NC) is induced either by an asymmetric arrangement of constituents or by a dissymmetric field of a chiral ligand layer. Herein, we unveil the origin of chirality in Ag29 NCs, which is attributed to the intrinsically chiral atomic arrangement. The X-ray crystal structure of a Ag29(BDT)12(TPP)4 NC (BDT: 1,3-benzenedithiol; TPP: triphenylphosphine) manifested the presence of intrinsic chirality in the outer shell capping the icosahedral achiral Ag13 core. The enantiomers of the Ag29(BDT)12(TPP)4 NC are separated by high-performance liquid chromatography (HPLC) using a chiral column for the first time, showing mirror-image circular dichroism (CD) spectra. The CD spectra are reproduced by time-dependent density functional theory (TDDFT) calculations based on enantiomeric Ag29 models with achiral 1,3-propanedithiolate ligands. The mechanism of chiral induction in the synthesis of Ag29(DHLA)12 (DHLA: a-dihydrolipoic acid) NCs with a chiral ligand system is further discussed with the aid of DFT calculations. The use of the enantiomeric DHLA ligand preferentially leads to a one-handed atomic arrangement which is more stable than the opposite one, inducing the enantiomeric excess in the population of intrinsically chiral Ag29 NCs with CD activity

Abstract

The fifty–year proposal of nondissociative racemization reaction of a tetracoordinated tetrahedral center from one enantiomer to another via a planar transition state by Hoffmann and coworkers has been explored by many research groups during the past five decades. A number of stable molecules with planar tetracoordinate and higher-coordinate centers have been designed and experimentally realized; however, there has not been a single example of molecular system that can possibly undergo such racemization. Here we show examples of molecular species that undergo inversion of stereochemistry around tetrahedral centers (Si, Al− and P+) either via a planar transition state or an intermediate state using quantum mechanical, ab initio quasi-classical dynamics calculations, and Born-Oppenheimer molecular dynamics (BOMD) simulations. This work is expected to provide potential leads for future studies on this fundamental phenomenon in chemistry.

Abstract

Noncovalent interactions are key determinants in both chemical and biological processes. Among such processes, the hydrophobic interactions play an eminent role in folding of proteins, nucleic acids, formation of membranes, protein-ligand recognition, etc.. Though this interaction is mediated through the aqueous solvent, the stability of the above biomolecules can be highly sensitive to any small external perturbations, such as temperature, pressure, pH, or even cosolvent additives, like, urea-a highly soluble small organic molecule utilized by various living organisms to regulate osmotic pressure. A plethora of detailed studies exist covering both experimental and theoretical regimes, to understand how urea modulates the stability of biological macromolecules. While experimentalists have been primarily focusing on the thermodynamic and kinetic aspects, theoretical modeling predominantly involves mechanistic information at the molecular level, calculating atomistic details applying the force field approach to the high level electronic details using the quantum mechanical methods. The review focuses mainly on examples with biological relevance, such as (1) urea-assisted protein unfolding, (2) urea-assisted RNA unfolding, (3) urea lesion interaction within damaged DNA, (4) urea conduction through membrane proteins, and (5) protein-ligand interactions those explicitly address the vitality of hydrophobic interactions involving exclusively the urea-aromatic moiety.

Abstract

Recent advances in artificial intelligence along with the development of large data sets of energies calculated using quantum mechanical (QM)/density functional theory (DFT) methods have enabled prediction of accurate molecular energies at reasonably low computational cost. However, machine learning models that have been reported so far require the atomic positions obtained from geometry optimizations using high‐level QM/DFT methods as input in order to predict the energies and do not allow for geometry optimization. In this study, a transferable and molecule size‐independent machine learning model bonds (B), angles (A), nonbonded (N) interactions, and dihedrals (D) neural network (BAND NN) based on a chemically intuitive representation inspired by molecular mechanics force fields is presented. The model predicts the atomization energies of equilibrium and nonequilibrium structures as sum of energy contributions from bonds (B), angles (A), nonbonds (N), and dihedrals (D) at remarkable accuracy. The robustness of the proposed model is further validated by calculations that span over the conformational, configurational, and reaction space. The transferability of this model on systems larger than the ones in the data set is demonstrated by performing calculations on selected large molecules. Importantly, employing the BAND NN model, it is possible to perform geometry optimizations starting from nonequilibrium structures along with predicting their energies. © 2019 Wiley Periodicals, Inc.

Abstract

Solubility of drug molecules is related to pharmacokinetic properties such as absorption and distribution, which affects the amount of drug that is available in the body for its action. Computational or experimental evaluation of solvation free energies of drug-like molecules/solute that quantify solubilities is an arduous task and hence development of reliable computationally tractable models is sought after in drug discovery tasks in pharmaceutical industry. Here, we report a novel method based on graph neural network to predict solvation free energies. Previous studies considered only the solute for solvation free energy prediction and ignored the nature of the solvent, limiting their practical applicability. The proposed model is an end-to-end framework comprising three phases namely, message passing, interaction and prediction phases. In the first phase, message passing neural network was used to compute inter-atomic interaction within both solute and solvent molecules represented as molecular graphs. In the interaction phase, features from the preceding step is used to calculate a solute-solvent interaction map, since the solvation free energy depends on how (un)favorable the solute and solvent molecules interact with each other. The calculated interaction map that captures the solute-solvent interactions along with the features from the message passing phase is used to predict the solvation free energies in the final phase. The model predicts solvation free energies involving a large number of solvents with high accuracy. We also show that the interaction map captures the electronic and steric factors that govern the solubility of drug-like molecules and hence is chemically interpretable.

Abstract

Recent years have witnessed utilization of modern machine learning approaches for predicting properties of material using available datasets. However, to identify potential candidates for material discovery, one has to systematically scan through a large chemical space and subsequently calculate the properties of all such samples. On the other hand, generative methods are capable of efficiently sampling the chemical space and can generate molecules/materials with desired properties. In this study, we report a deep learning based inorganic material generator (DING) framework consisting of a generator module and a predictor module. The generator module is developed based upon conditional variational autoencoders (CVAE) and the predictor module consists of three deep neural networks trained for predicting enthalpy of formation, volume per atom and energy per atom chosen to demonstrate the proposed method. The predictor and generator modules have been developed using a one hot key representation of the material composition. A series of tests were done to examine the robustness of the predictor models, to demonstrate the continuity of the latent material space, and its ability to generate materials exhibiting target property values. The DING architecture proposed in this paper can be extended to other properties based on which the chemical space can be efficiently explored for interesting materials/molecules.

Abstract

We examine the mutual exclusion problem of concurrency through the systematic application of modern feedback control theory, by revisiting the classical problem involving mutual exclusion: the Generalised Dining Philosophers problem. The result is a modular development of the solution using the notions of system and system composition in a formal setting that employs simple equational reasoning. The modular approach separates the solution architecture from the algorithmic minutiae and has the benefit of simplifying the design and correctness proofs. Two variants of the problem are considered: centralised and distributed topology with N philosophers. In each case, solving the Generalised Dining Philosophers reduces to designing an appropriate feedback controller.

Abstract

Unlike CPUs and GPUs, it is possible to use custom fixed-point data types, specified as a tuple (α, β), on FPGAs. The parameters α and β denote the number of integral and fractional bitwidths respectively. The power and area savings while performing arithmetic operations on fixed-point data types are well known to be significant over using floating-point data types. In this paper, we propose a hybrid approach involving interval analysis and SMT solvers, for estimating integral bitwidths at different compute stages, in an image processing pipeline, specified using a domain-specific language (DSL) such as PolyMage. The DSL specification facilitates the compiler analysis to infer the underlying computational structure with ease. We also propose a simple and practical profile-driven greedy heuristic search technique for fractional bitwidth analysis. Using the Horn-Schunck Optical Flow benchmark program, we demonstrate where the conventional range analysis approaches fail, and how we overcome them using the hybrid technique proposed in this paper. The integral bitwidth estimates provided by the hybrid technique on the optical flow benchmark are up to 3x times better when compared with interval analysis.

Abstract

Finding the centrality measures of nodes in a graph is a problem of fundamental importance due to various applications from social networks, biological networks, and transportation networks. Given the large size of such graphs, it is natural to use parallelism as a recourse. There have been several studies that show how to compute the various centrality measures of nodes in a graph on parallel architectures, including multi-core systems and GPUs. However, as these graphs evolve and change, it is pertinent to study how to update the centrality measures on changes to the underlying graph. In this paper, we show novel parallel algorithms for updating the betweenness- and closeness-centrality values of nodes in a dynamic graph. Our algorithms process a batch of updates in parallel by extending the approach of handling a single update for etweennessand closeness-centrality by Jamour et al. [16] and Sarıyüce et al. [27], respectively. Besides, our algorithms incorporate mechanisms to exploit the structural properties of graphs for enhanced performance.