Topological "Shape" in Micellar Dynamics.

For micelles, "shape" is prominent in rheological computations of fluid flow, but this "shape" is often expressed too informally to be useful for rigorous analyses. We formalize topological "shape equivalence" of micelles, both globally and locally, to enable visualization of computational fluid dynamics. Although topological methods in visualization provide significant insights into fluid flows, this opportunity has been limited by the known difficulties in creating representative geometry. We present an agile geometric algorithm to represent the micellar shape for input into fluid flow visualizations. We show that worm-like and cylindrical micelles have formally equivalent shapes, but that visualization accentuates unexplored differences. This global-local paradigm is extensible beyond micelles.

Roughness of Molecular Property Landscapes and Its Impact on Modellability.

In molecular discovery and drug design, structure-property relationships and activity landscapes are often qualitatively or quantitatively analyzed to guide the navigation of chemical space. The roughness (or smoothness) of these molecular property landscapes is one of their most studied geometric attributes, as it can characterize the presence of activity cliffs, with rougher landscapes generally expected to pose tougher optimization challenges. Here, we introduce a general, quantitative measure for describing the roughness of molecular property landscapes. The proposed roughness index (ROGI) is loosely inspired by the concept of fractal dimension and strongly correlates with the out-of-sample error achieved by machine learning models on numerous regression tasks.

Self-Focusing Virtual Screening with Active Design Space Pruning.

High-throughput virtual screening is an indispensable technique utilized in the discovery of small molecules. In cases where the library of molecules is exceedingly large, the cost of an exhaustive virtual screen may be prohibitive. Model-guided optimization has been employed to lower these costs through dramatic increases in sample efficiency compared to random selection. However, these techniques introduce new costs to the workflow through the surrogate model training and inference steps. In this study, we propose an extension to the framework of model-guided optimization that mitigates inference costs using a technique we refer to as design space pruning (DSP), which irreversibly removes poor-performing candidates from consideration. We study the application of DSP to a variety of optimization tasks and observe significant reductions in overhead costs while exhibiting similar performance to the baseline optimization. DSP represents an attractive extension of model-guided optimization that can limit overhead costs in optimization settings where these costs are non-negligible relative to objective costs, such as docking.

Efficient Algorithm for the Topological Characterization of Worm-like and Branched Micelle Structures from Simulations.

Many surfactant-based formulations are utilized in industry as they produce desirable viscoelastic properties at low concentrations. These properties are due to the presence of worm-like micelles (WLMs), and as a result, understanding the processes that lead to WLM formation is of significant interest. Various experimental techniques have been applied with some success to this problem but can encounter issues probing key microscopic characteristics or the specific regimes of interest. The complementary use of computer simulations could provide an alternate route to accessing their structural and dynamic behavior. However, few computational methods exist for measuring key characteristics of WLMs formed in particle simulations. Further, their mathematical formulations are challenged by WLMs with sharp curvature profiles or density fluctuations along the backbone. Here, we present a new topological algorithm for identifying and characterizing WLMs in particle simulations, which has desirable mathematical properties that address shortcomings in previous techniques. We apply the algorithm to the case of sodium dodecyl sulfate micelles to demonstrate how it can be used to construct a comprehensive topological characterization of the observed structures.

K-mer clustering algorithm using a MapReduce framework: application to the parallelization of the Inchworm module of Trinity.

BACKGROUND: De novo transcriptome assembly is an important technique for understanding gene expression in non-model organisms. Many de novo assemblers using the de Bruijn graph of a set of the RNA sequences rely on in-memory representation of this graph. However, current methods analyse the complete set of read-derived k-mer sequence at once, resulting in the need for computer hardware with large shared memory. RESULTS: We introduce a novel approach that clusters k-mers as the first step. The clusters correspond to small sets of gene products, which can be processed quickly to give candidate transcripts. We implement the clustering step using the MapReduce approach for parallelising the analysis of large datasets, which enables the use of compute clusters. The computational task is distributed across the compute system using the industry-standard MPI protocol, and no specialised hardware is required. Using this approach, we have re-implemented the Inchworm module from the widely used Trinity pipeline, and tested the method in the context of the full Trinity pipeline. Validation tests on a range of real datasets show large reductions in the runtime and per-node memory requirements, when making use of a compute cluster. CONCLUSIONS: Our study shows that MapReduce-based clustering has great potential for distributing challenging sequencing problems, without loss of accuracy. Although we have focussed on the Trinity package, we propose that such clustering is a useful initial step for other assembly pipelines.

Toward a Standard Protocol for Micelle Simulation.

In this paper, we present protocols for simulating micelles using dissipative particle dynamics (and in principle molecular dynamics) that we expect to be appropriate for computing micelle properties for a wide range of surfactant molecules. The protocols address challenges in equilibrating and sampling, specifically when kinetics can be very different with changes in surfactant concentration, and with minor changes in molecular size and structure, even using the same force field parameters. We demonstrate that detection of equilibrium can be automated and is robust, for the molecules in this study and others we have considered. In order to quantify the degree of sampling obtained during simulations, metrics to assess the degree of molecular exchange among micellar material are presented, and the use of correlation times are prescribed to assess sampling and for statistical uncertainty estimates on the relevant simulation observables. We show that the computational challenges facing the measurement of the critical micelle concentration (CMC) are somewhat different for high and low CMC materials. While a specific choice is not recommended here, we demonstrate that various methods give values that are consistent in terms of trends, even if not numerically equivalent.

A computational model for overcoming drug resistance using selective dual-inhibitors for aurora kinase A and its T217D variant.

The human Aurora kinase-A (AK-A) is an essential mitotic regulator that is frequently overexpressed in several cancers. The recent development of several novel AK-A inhibitors has been driven by the well-established association of this target with cancer development and progression. However, resistance and cross-reactivity with similar kinases demands an improvement in our understanding of key molecular interactions between the Aurora kinase-A substrate binding pocket and potential inhibitors. Here, we describe the implementation of state-of-the-art virtual screening techniques to discover a novel set of Aurora kinase-A ligands that are predicted to strongly bind not only to the wild type protein, but also to the T217D mutation that exhibits resistance to existing inhibitors. Furthermore, a subset of these computationally screened ligands was shown to be more selective toward the mutant variant over the wild type protein. The description of these selective subsets of ligands provides a unique pharmacological tool for the design of new drug regimens aimed at overcoming both kinase cross-reactivity and drug resistance associated with the Aurora kinase-A T217D mutation.