16 papers · ranked by Valyu relevance
Samuel Genheden, Esben Bjerrum
We introduce a framework for benchmarking multi-step retrosynthesis methods, i.e. route predictions, called PaRoutes. The framework consists of two sets of 10,000 synthetic routes extracted from the patent literature, a list of stock compounds, and a curated set of reactions on which one-step retrosynthesis models can…
Authors not listed
Accurately predicting the diverse bound-state conformations of small molecules is crucial for successful drug discovery and design, particularly when detailed protein-ligand interactions are unknown. Established tools exist, but efficiently exploring the vast conformational space remains challenging. This work…
Jonas Verhellen
Computer-assisted design of small molecules has experienced a resurgence in academic and indus- trial interest due to the widespread use of data-driven techniques such as deep generative models. While the ability to generate molecules that fulfill required chemical properties is encouraging, the use of deep learning…
Authors not listed
The identification of kinetically feasible reaction pathways that connect a reactant to its product, including numerous intermediates and transition states, is crucial for predicting chemical reactions and elucidating reaction mechanisms. However, as molecular systems become increasingly complex or larger, the number…
Nathanael J. King, Ian LeBlanc, Alex Brown
Conformational ensemble generation and the search for the global minimum conformation are important problems in computational chemistry. In this work, a variant on the Conformer-Rotamer Ensemble Sampling Tool (CREST) iterative metadynamics (iMTD) algorithm designed for determining structural ensembles and energetics of…
Lionel Zoubritzky, François-Xavier Coudert
We present here an open-source Julia library for the topological identification of crystalline materials, with algorithmic and computational improvements over the previously available software in the field, resulting in a speed increase of one order of magnitude. This new algorithm and implementation can therefore be…
Benjamin Ries, Irfan Alibay, David W H Swenson, Hannah M Baumann + 3 more
Relative binding free energy (RBFE) calculations have emerged as a powerful tool supporting ligand optimization in drug discovery. Despite many successes, the use of RBFEs can often be limited by automation problems, in particular the setup of such calculations. Atom mapping algorithms are an essential component in…
Akhil Shajan, Madushanka Manathunga, Andreas Goetz, Kenneth Merz
Based on a series of energy minimizations with starting structures obtained from the Baker test set of 30 organic molecules, a comparison is made between various open- source geometry optimization codes that are interfaced with the open-source QUantum Interaction Computational Kernel (QUICK) program for gradient and…
Benjamin Ries, Richard J Gowers, James RB Eastwood, Irfan Alibay + 4 more
Alchemical free energy campaigns can be planned using graph theory by building up networks that contain nodes representing molecules that are connected by possible transformations as edges. We introduce Konnektor, an open-source Python package, for systematically planning, modifying, and analyzing free energy…
Authors not listed
Terminally labeled DNA oligonucleotides have wide applications in modern biology and biotechnological applications. It has been observed that the fluorescent intensity of light released from these fluorescent labels is heavily influenced by the terminal sequence of nucleotides. Recent studies have assayed and published…
AKHIL SHAJAN, Madushanka Manathunga, Andreas Goetz, Kenneth Merz
Based on a series of energy minimizations with starting structures obtained from the Baker test set of 30 organic molecules, a comparison is made between various open-source geometry optimization codes that are interfaced with the open-source QUantum Interaction Computational Kernel (QUICK) program for gradient and…
Authors not listed
Computer-Assisted Synthesis Programs are increasingly employed by organic chemists. Often, these tools combine neural networks for policy prediction with heuristic search algorithms. We propose two novel enhancements, which we call eUCT and dUCT, to the Monte Carlo tree search (MCTS) algorithm. The enhancements were…
Authors not listed
Identifying synthesis routes from knowledge graphs poses challenges beyond retrosynthesis, including path–finding artifacts and data issues. We introduce “SynGPS”, a novel algorithm that overcomes these limitations by identifying viable routes even with common artifacts. SynGPS can resolve nonsensical cycles…
Andre KY Low, Flore Mekki-Berrada, Aleksandr Ostudin, Jiaxun Xie + 7 more
The development of automated high-throughput experimental platforms has enabled fast sampling of high-dimensional decision spaces. To reach target properties efficiently, these platforms are increasingly paired with intelligent experimental design. When solving optimization problems, Bayesian-based optimizers are often…
Authors not listed
Background: Pharmaceutical batch scheduling in multi-reactor configurations presents complex optimization challenges under operational uncertainty, yet limited research addresses how parallel processing capacity affects heuristic performance and predictive modeling. Objectives: This study investigated scheduling…
Zhenghao Wu, Tianhang Zhou
In the realm of multiscale molecular simulations, structure-based coarse graining is a prominent approach for creating efficient coarse-grained (CG) representations of soft matter systems such as polymers. This involves optimizing CG interactions by matching static correlation functions of corresponding degrees of…