Investigation of the Effect of Peptide p5 Targeting CDK5-p25 Hyperactivity on Munc18-1 (P67) Regulating Neuronal Exocytosis Using Molecular Simulations.

Munc18-1 is an SM (sec1/munc-like) family protein involved in vesicle fusion and neuronal exocytosis. Munc18-1 is known to regulate the exocytosis process by binding with closed- and open-state conformations of Syntaxin1, a protein belonging to the SNARE family established to be central to the exocytosis process. Our previous work studied peptide p5 as a promising drug candidate for CDK5-p25 complex, an Alzheimer's disease (AD) pathological target. Experimental in vivo and in vitro studies suggest that Munc18-1 promotes p5 to selectively inhibit the CDK5-p25 complex without affecting the endogenous CDK5 activity, a characteristic of remarkable therapeutic implications. In this paper, we identify several binding modes of p5 with Munc18-1 that could potentially affect the Munc18-1 binding with SNARE proteins and lead to off-target effects on neuronal communication using molecular dynamics simulations. Recent studies indicate that disruption of Munc18-1 function not only disrupts neurotransmitter release but also results in neurodegeneration, exhibiting clinical resemblance to other neurodegenerative conditions such as AD, causing diagnostic and treatment challenges. We characterize such interactions between p5 and Munc18-1, define the corresponding pharmacophores, and provide guidance for the in vitro validation of our findings to improve therapeutic efficacy and safety of p5.

Computational Study of the Allosteric Effects of p5 on CDK5-p25 Hyperactivity as Alternative Inhibitory Mechanisms in Neurodegeneration.

The cyclin-dependent kinase (CDK5) forms a stable complex with its activator p25, leading to the hyperphosphorylation of tau proteins and to the formation of plaques and tangles that are considered to be one of the typical causes of Alzheimer's disease (AD). Hence, the pathological CDK5-p25 complex is a promising therapeutic target for AD. Small peptides, obtained from the truncation of CDK5 physiological activator p35, have shown promise in inhibiting the pathological complex effectively while also crossing the blood-brain barrier. One such small 24-residue peptide, p5, has shown selective inhibition toward the pathological complex in vivo. Our previous research focused on the characterization of a computationally predicted CDK5-p5 binding mode and of its pharmacophore, which was consistent with competitive inhibition. In continuation of our previous work, herein, we investigate four additional binding modes to explore other possible mechanisms of interaction between CDK5 and p5. The quantitative description of the pharmacophore is consistent with both competitive and allosteric p5-induced inhibition mechanisms of CDK5-p25 pathology. The gained insights can direct further in vivo/in vitro tests and help design small peptides, linear or cyclic, or peptidomimetic compounds as adjuvants of orthosteric inhibitors or as part of a cocktail of drugs with enhanced effectiveness and lower side effects.

Graph convolutional neural network applied to the prediction of normal boiling point.

In this article, we describe training and validation of a machine learning model for the prediction of organic compound normal boiling points. Data are drawn from the experimental literature as captured in the NIST Thermodynamics Research Center (TRC) SOURCE Data Archival System. The machine learning model is based on a graph neural network approach, a methodology that has proven powerful when applied to a variety of chemical problems. Model input is extracted from a 2D sketch of the molecule, making the methodology suitable for rapid prediction of normal boiling points in a wide variety of scenarios. Our final model predicts normal boiling points within 6 K (corresponding to a mean absolute percent error of 1.32%) with sample standard deviation less than 8 K. Additionally, we found that our model robustly identifies errors in the input data set during the model training phase, thereby further motivating the utility of systematic data exploration approaches for data-related efforts.

Predicting Kováts Retention Indices Using Graph Neural Networks.

The Kováts retention index is a dimensionless quantity that characterizes the rate at which a compound is processed through a gas chromatography column. This quantity is independent of many experimental variables and, as such, is considered a near-universal descriptor of retention time on a chromatography column. The Kováts retention indices of a large number of molecules have been determined experimentally. The "NIST 20: GC Method/Retention Index Library" database has collected and, more importantly, curated retention indices of a subset of these compounds resulting in a highly valued reference database. The experimental data in the library form an ideal data set for training machine learning models for the prediction of retention indices of unknown compounds. In this article, we describe the training of a graph neural network model to predict the Kováts retention index for compounds in the NIST library and compare this approach with previous work [1]. We predict the Kováts retention index with a mean unsigned error of 28 index units as compared to 44, the putative best result using a convolutional neural network [1]. The NIST library also incorporates an estimation scheme based on a group contribution approach that achieves a mean unsigned error of 114 compared to the experimental data. Our method uses the same input data source as the group contribution approach, making its application straightforward and convenient to apply to existing libraries. Our results convincingly demonstrate the predictive powers of systematic, data-driven approaches leveraging deep learning methodologies applied to chemical data and for the data in the NIST 20 library outperform previous models.

Effect of the scaffold microenvironment on cell polarizability and capacitance determined by probabilistic computations.

In living systems, it is frequently stated that form follows function by virtue of evolutionary pressures on organism development, but in the study of how functions emerge at the cellular level, function often follows form. We study this chicken versus egg problem of emergent structure-property relationships in living systems in the context of primary human bone marrow stromal cells cultured in a variety of microenvironments that have been shown to cause distinct patterns of cell function and differentiation. Through analysis of a publicly available catalog of three-dimensional (3D) cell shape data, we introduce a family of metrics to characterize the 'form' of the cell populations that emerge from a variety of diverse microenvironments. In particular, measures of form are considered that are expected to have direct significance for cell function, signaling and metabolic activity: dimensionality, polarizability and capacitance. Dimensionality was assessed by an intrinsic measure of cell shape obtained from the polarizability tensor. This tensor defines ellipsoids for arbitrary cell shapes and the thinnest dimension of these ellipsoids, P 1, defines a reference minimal scale for cells cultured in a 3D microenvironment. Polarizability governs the electric field generated by a cell, and determines the cell's ability to detect electric fields. Capacitance controls the shape dependence of the rate at which diffusing molecules contact the surface of the cell, and this has great significance for inter-cellular signaling. These results invite new approaches for designing scaffolds which explicitly direct cell dimensionality, polarizability and capacitance to guide the emergence of new cell functions derived from the acquired form.

A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows.

Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and processor occupancy. The Hybrid Task Graph Scheduler (HTGS) improves programmer productivity when implementing hybrid workflows for multi-core and multi-GPU systems. The Hybrid Task Graph Scheduler (HTGS) is an abstract execution model, framework, and API that increases programmer productivity when implementing hybrid workflows for such systems. HTGS manages dependencies between tasks, represents CPU and GPU memories independently, overlaps computations with disk I/O and memory transfers, keeps multiple GPUs occupied, and uses all available compute resources. Through these abstractions, data motion and memory are explicit; this makes data locality decisions more accessible. To demonstrate the HTGS application program interface (API), we present implementations of two example algorithms: (1) a matrix multiplication that shows how easily task graphs can be used; and (2) a hybrid implementation of microscopy image stitching that reduces code size by ≈ 43% compared to a manually coded hybrid workflow implementation and showcases the minimal overhead of task graphs in HTGS. Both of the HTGS-based implementations show good performance. In image stitching the HTGS implementation achieves similar performance to the hybrid workflow implementation. Matrix multiplication with HTGS achieves 1.3× and 1.8× speedup over the multi-threaded OpenBLAS library for 16k × 16k and 32k × 32k size matrices, respectively.

MIST: Accurate and Scalable Microscopy Image Stitching Tool with Stage Modeling and Error Minimization.

Automated microscopy can image specimens larger than the microscope's field of view (FOV) by stitching overlapping image tiles. It also enables time-lapse studies of entire cell cultures in multiple imaging modalities. We created MIST (Microscopy Image Stitching Tool) for rapid and accurate stitching of large 2D time-lapse mosaics. MIST estimates the mechanical stage model parameters (actuator backlash, and stage repeatability 'r') from computed pairwise translations and then minimizes stitching errors by optimizing the translations within a (4r)2 square area. MIST has a performance-oriented implementation utilizing multicore hybrid CPU/GPU computing resources, which can process terabytes of time-lapse multi-channel mosaics 15 to 100 times faster than existing tools. We created 15 reference datasets to quantify MIST's stitching accuracy. The datasets consist of three preparations of stem cell colonies seeded at low density and imaged with varying overlap (10 to 50%). The location and size of 1150 colonies are measured to quantify stitching accuracy. MIST generated stitched images with an average centroid distance error that is less than 2% of a FOV. The sources of these errors include mechanical uncertainties, specimen photobleaching, segmentation, and stitching inaccuracies. MIST produced higher stitching accuracy than three open-source tools. MIST is available in ImageJ at isg.nist.gov.

Acceleration and Parallelization of ZENO/Walk-on-Spheres.

This paper describes our on-going work to accelerate ZENO, a software tool based on Monte Carlo methods (MCMs), used for computing material properties at nanoscale. ZENO employs three main algorithms: (1) Walk on Spheres (WoS), (2) interior sampling, and (3) surface sampling. We have accelerated the first two algorithms. For the sake of brevity, the paper will discuss our work on the first one only as it is the most commonly used and the acceleration techniques were similar in both cases. WoS is a Brownian motion MCM for solving a class of partial differential equations (PDEs). It provides a stochastic solution to a PDE by estimating the probability that a random walk, which started at infinity, will hit the surface of the material under consideration. WoS is highly effective when the problem's geometry is additive, as this greatly reduces the number of walk steps needed to achieve accurate results. The walks start on the surface of an enclosing sphere and can make much larger jumps than in a direct simulation of Brownian motion. Our current implementation represents the molecular structure of nanomaterials as a union of possibly overlapping spheres. The core processing bottleneck in WoS is a Computational Geometry one, as the algorithm repeatedly determines the distance from query point to the material surface in each step of the random walk. In this paper, we present results from benchmarking spatial data structures, including several open-source implementations of k-D trees, for accelerating WoS algorithmically. The paper also presents results from our multicore and cluster parallel implementation to show that it exhibits linear strong scaling with the number of cores and compute nodes; this implementation delivers up to 4 orders of magnitude speedup compared to the original FORTRAN code when run on 8 nodes (each with dual 6-core Intel Xeon CPUs) with 24 threads per node.