Search bioRxiv⌕ Search

Biology subjects

Waldispuhl, J.

Publications and source records attributed to Waldispuhl, J..

11 recordsLinked to original sources

Can SMILES be fragmented into a concatenable ordered sequence of retrosynthetically interesting string block ?

Molecules generated by deep learning models are often difficult to synthesize. Their synthetic accessibility can be improved with automated retrosynthetic analysis, which allows for identifying synthons. However, synthons in a SMILES can be scattered throughout the string depending on the path taken through the molecular graph used to generate the SMILES. We tested whether the ensemble of possible SMILES for a molecule can be used to generate a concatenable ordered sequence of string fragments (blocks) from SMILES that match potential synthons obtained through automated retrosynthetic analysis. We found that exhaustively sampling the SMILES space of a molecule improves the coverage of retrosynthetic breaks. We achieved full coverage of retrosynthetic bonds in string form for 85\% of the 1.9 million molecules in the MOSES dataset. Doing so allowed us to test our block SMILES in an unconditional de novo drug design test case with MolGPT and Monte Carlo Tree Search (MCTS). We found that using blocks as an LLM's token did degrade MolGPT performance due to the curse of dimensionality. However, using the SMILES selected by our blocking algorithm with the default SMILES tokenizer improved the reproduction of physico-chemical properties of samples and also improved uniqueness, novelty, and validity. The MCTS outperforms our MolGPT models in terms of validity and novelty. However, samples generated by the MCTS had physico-chemical properties that were further away from the MOSES baseline than the samples produced by molGPT, with an improved distribution of quantitative estimation of drug-likeness (QED).

bioinformatics↗

Adaptive 2.5D base-pairing subgraph search detects RNA small-molecule binding sites

Ribo-LENS is a geometric deep-learning framework for detecting small-molecule binding sites in RNA structures. It is designed to exploit two properties of RNA base-pairing networks: their robustness to conformational fluctuation and the functional signatures they encode. By reasoning directly in the space of base-pairing subgraphs, Ribo-LENS assembles coherent binding sites, in contrast to methods that score residues independently. In extensive experiments, Ribo-LENS is competitive with, and often outperforms, large all-atom co-folding models (AlphaFold3, Chai-1), fine-tuned language models (GerNA-Bind), and structure-based tools (RNAsite), raising mean MCC to 0.380 (versus 0.321 for the state-of-the-art GerNA-Bind). It is strongly robust to apo/holo rearrangement, with its accuracy tracking the base-pairing graph (Spearman{rho} = 0.82 with binding-site graph edit distance) rather than backbone displacement ({rho} = -0.15 with RMSD), and depends far less on sequence homology than competing predictors. In an end-to-end, sequence-based virtual screen of the ROBIN assay ([~]25,000 compounds), Ribo-LENS guides docking to a small predicted pocket, matching a blind all-atom cavity search (enrichment factors up to 6.1) at a fraction of the search cost; on two SARS-CoV-2 targets its predicted sites align with NMR chemical-shift perturbations. Ribo-LENS turns coarse base-pairing structure into a practical entry point for screening the vast, largely unexplored RNA target space.

bioinformatics↗

Improving the reliability of molecular string representations for generative chemistry

Generative modeling for chemistry has advanced rapidly in recent years, but this surge in popularity raises a foundational question: which molecular representation is best suited for modern machine learning models? Despite not being designed for generative tasks, SMILES remain the most commonly used string-based representation. However, while SMILES follow strict syntactic rules, grammatically correct SMILES strings do not always correspond to valid molecules. SELFIES were introduced as an alternative that addresses this limitation by ensuring that every string of SELFIES tokens represents to a valid molecule. In this study, we comprehensively evaluate the limitations of both SMILES and SELFIES as representations for generative models. We define two key criteria for robust molecular generation: viability, generated strings represent novel, unique molecules with correct valence, and fidelity, the distribution of physicochemical properties from sampled molecules resembles that of the training data. We find that approximately one-fifth of molecules generated using canonical SMILES are invalid, failing the viability criterion. In contrast, all SELFIES-generated molecules are viable, but they deviate significantly from the training distribution, indicating low fidelity. To address these limitations, we develop data augmentation procedures for both representations. While simplifying the SELFIES grammar yields only modest gains in fidelity, our stochastic augmentation method for SMILES, ClearSMILES, significantly improves both viability and fidelity. ClearSMILES simplifies syntax by reducing the vocabulary size and explicitly encoding aromaticity via Kekule SMILES, making it easier string representations for models to process. Using ClearSMILES, the rate of invalid samples decreases by an order of magnitude, from 20% to 2.2%, and fidelity to the training distribution is also moderately improved. Generative chemistry has seen rapid development recently. However, models based on string representations of molecules still rely largely on SMILES1 that have not been developed for this context and SELFIES 2 who were introduced to reduce those problems. The goal of this study is to first analyze the difficulty encountered by a small generative model when using SMILES and SELFIES. Our study found that SELFIES and canonical SMILES 3 are not fully reliable representations for a small generative model, i.e. do not ensure concurrently the viability and fidelity of samples. Viable samples represent novel, unique molecules with correct valence, while fidelity is efficient distribution learning of key physico-chemical properties. 4 In fact, 20% of the samples generated using canonical SMILES input representation do not correspond to valid molecules. In contrast, samples generated using SELFIES were all viable but where not able to reproduce as well the distribution of physico-chemical properties as SMILES. As a mitigation strategy for the previously identified problems, we have developed data augmentation procedures for both SELFIES and SMILES. Simplifying the complex syntax of SELFIES yielded only marginal improvements in string stability and overall fidelity to the training set. For SMILES, we developed a stochastic data augmentation procedure called ClearSMILES, which reduces the vocabulary size needed to represent a SMILES dataset, explicitly represents aromaticity via Kekule SMILES, 3 and reduces the effort required by deep learning models to process SMILES. ClearSMILES reduced the rate of invalid samples by an order of magnitude, from 20% to 2.2%, and improved the fidelity of samples to the training set.

bioinformatics↗

Semi-supervised learning and large-scale docking data accelerate RNA virtual screening

RNAs constitute a vast reservoir of mostly untapped drug targets. Structure-based virtual screening (VS) methods screen large compound libraries for identifying promising candidate molecules by conditioning on binding site information. The classical approach relies on molecular docking simulations. However, this strategy does not scale well with the size of the small molecule databases and the number of potential RNA targets. Machine learning emerged as a promising technology to resolve this bottleneck. Efficient data-driven VS methods have already been introduced for proteins, but these techniques have not yet been developed for RNAs due to limited dataset sizes and lack of practical use-case evaluation. We propose a data-driven VS pipeline that deals with the unique challenges of RNA molecules through coarse grained modeling of 3D structures and heterogeneous training regimes using synthetic data augmentation and RNA-centric self supervision. We report strong prediction and generalizability of our framework, ranking active compounds among inactives in the top 2.8% on average on a structurally distinct drug-like test set. Those predictions are sensitive, but robust to pockets alterations, opening the door to its use on binding site detection methods outputs. Our model results in a ten thousand-times speedup over docking techniques while obtaining higher performance. Finally, we deploy our model on a recently published in-vitro small molecule microarray experiment with 20,000 compounds and report a mean enrichment factor at 1% of 2.93 on four unseen RNA riboswitches. To our knowledge, this is the first experimental evidence of success for structure-based deep learning methods in RNA virtual screening. Our source code and data, as well as a Google Colab notebook for inference, are available on GitHub.1

bioinformatics↗

When Citizen Science meets teaching: A storified citizen science computer game to teach and contribute to genomic data analysis

In the last decade, video games became a common vehicle for citizen science initiatives in life science, allowing participants to contribute to real scientific data analysis while learning about it. Since 2010, our scientific discovery game (SDG) Phylo enlists participants in comparative genomic data analysis. It is frequently used as a learning tool, but the activities were difficult to aggregate to build a coherent teaching activity. Here, we describe a strategy and series of recipes to facilitate the integration of SDGs in courses and implement this approach in Phylo. We developed new roles and functionalities enabling instructors to create assignments and monitor the progress of students. A story mode progressively introduces comparative genomics concepts, allowing users to learn and contribute to the analysis of real genomic sequences. Preliminary results from a user study suggest this framework may help to boost user motivation and clarify pedagogical objectives.

scientific communication and education↗

OptiMol: Optimization of binding affinities in chemical space for drug discovery

Ligand-based drug design has recently benefited from the boost of deep generative models. These models enable extensive explorations of the chemical space, and provide a platform for molecular optimization. However, current state of the art methods do not leverage the structure of the target, which is known to play a key role in the interaction. We propose an optimization pipeline that leverages complementary structure-based and ligand-based methods. Instead of performing docking on a fixed drug bank, we iteratively select promising compounds in the whole chemical space using a ligand-centered generative model. Molecular docking is then used as an oracle to guide compound optimization. This allows to iteratively generate leads that better fit the target structure, in a closed optimization loop, without prior knowledge about bio-actives. For this purpose, we introduce a new graph to selfies VAE which benefits from a seventeen times faster decoding than graph to graph methods while being competitive with the state of the art. We then successfully optimize the generation of molecules towards high docking scores, enabling a ten-fold augmentation of high-scoring compounds found with a fixed computational budget. AvailabilityCode is available on GitHub Contactjeromew@mcgill.ca

bioinformatics↗

Stochastic Sampling of Structural Contexts Improves the Scalability and Accuracy of RNA 3D Modules Identification

RNA structures possess multiple levels of structural organization. Secondary structures are made of canonical (i.e. Watson-Crick and Wobble) helices, connected by loops whose local conformations are critical determinants of global 3D architectures. Such local 3D structures consist of conserved sets of non-canonical base pairs, called RNA modules. Their prediction from sequence data is thus a milestone toward 3D structure modelling. Unfortunately, the computational efficiency and scope of the current 3D module identification methods are too limited yet to benefit from all the knowledge accumulated in modules databases. Here, we introduce BayesPairing 2, a new sequence search algorithm leveraging secondary structure tree decomposition which allows to reduce the computational complexity and improve predictions on new sequences. We benchmarked our methods on 75 modules and 6380 RNA sequences, and report accuracies that are comparable to the state of the art, with considerable running time improvements. When identifying 200 modules on a single sequence, BayesPairing 2 is over 100 times faster than its previous version, opening new doors for genome-wide applications.

bioinformatics↗

Extended RNA base pairing networks imprint small molecule binding preferences

AO_SCPLOWBSTRACTC_SCPLOWO_ST_ABSMotivationC_ST_ABSThe binding of small molecules to RNAs is an important mechanism which can stabilize 3D structures or activate key molecular functions. To date, computational and experimental efforts toward small molecule binding prediction have primarily focused on protein targets. Considering that a very large portion of the genome is transcribed into non-coding RNAs but only few regions are translated into proteins, successful annotations of RNA elements targeted by small-molecule would likely uncover a vast repertoire of biological pathways and possibly lead to new therapeutic avenues. ResultsOur work is a first attempt at bringing machine learning approaches to the problem of RNA drug discovery. RNAmigos takes advantage of the unique structural properties of RNA to predict small molecule ligands for unseen binding sites. A key feature of our model is an efficient representation of binding sites as augmented base pairing networks (ABPNs) aimed at encoding important structural patterns. We subject our ligand predictions to two virtual screen settings and show that we are able to rank the known ligand on average in the 73rd percentile, showing a significant improvement over several baselines. Furthermore, we observe that graphs which are augmented with non-Watson Crick (a.k.a non-canonical) base pairs are the only representation which is able to retrieve a significant signal, suggesting that non-canonical interactions are an necessary source of binding specificity in RNAs. We also find that an auxiliary graph representation task significantly boosts performance by providing efficient structural embeddings to the low data setting of ligand prediction. RNAmigos shows that RNA binding data contains structural patterns with potential for drug discovery, and provides methodological insights which can be applied to other structure-function learning tasks. AvailabilityCode and data is freely available at http://csb.cs.mcgill.ca/RNAmigos. Contactjerome@cs.mcgill.ca

bioinformatics↗

Computational Intractability Law Molds the Topology of Biological Networks

Virtually all molecular interaction networks (MINs), irrespective of organism or physiological context, have a majority of loosely-connected leaf genes interacting with at most 1-3 genes, and a minority of highly-connected hub genes interacting with at least 10 or more other genes. Previous reports proposed adaptive and non-adaptive hypotheses describing sufficient but not necessary conditions for the origin of this majority-leaves minority-hubs (mLmH) topology. We modeled the evolution of MINs as a computational optimization problem which describes the cost of conserving, deleting or mutating existing genes so as to maximize (minimize) the overall number of beneficial (damaging) interactions network-wide. The model 1) provides sufficient and, assuming [Formula], necessary conditions for the emergence of mLmH as a software adaptation to circumvent computational intractability, 2) predicts the percentage number of genes having d interacting partners, and 3) when employed as a fitness function in an evolutionary algorithm, produces mLmH-possessing synthetic networks whose degree distributions match those of equal-size MINs.\n\nSummaryOur results indicate that the topology of molecular interaction networks is a selected-for software adaptation that minimizes the evolutionary cost of re-wiring the network in response to an evolutionary pressure to conserve, delete or mutate existing genes and interactions.

systems biology↗

A Nested 2-Level Cross-validation Ensemble Learning Pipeline Suggests a Negative Pressure Against Crosstalk snoRNA-mRNA Interactions in Saccharomyces cerevisae

The growing number of RNA-mediated regulation mechanisms identified in the last decades suggests a widespread impact of RNA-RNA interactions. The efficiency of the regulation relies on highly specific and coordinated interactions, while simultaneously repressing the formation of opportunistic complexes. However, the analysis of RNA interactomes is highly challenging due to the large number of potential partners, discrepancy of the size of RNA families, and the inherent noise in interaction predictions.\n\nWe designed a recursive 2-step cross-validation pipeline to capture the specificity of ncRNA-mRNA interactomes. Our method has been designed to detect significant loss or gain of specificity between ncRNA-mRNA interaction profiles. Applied to snoRNA-mRNA in Saccharomyces Cerevisae, our results suggest the existence of a repression of ncRNA affinities with mRNAs, and thus the existence of an evolutionary pressure inhibiting such interactions.

bioinformatics↗

Science Game Lab: tool for the unification of biomedical games with a purpose

Games with a purpose and other kinds of citizen science initiatives demonstrate great potential for advancing biomedical science and improving STEM education. Articles documenting the success of projects such as Fold.it and Eyewire in high impact journals have raised wide interest in new applications of the distributed human intelligence that these systems have tapped into. However, the path from a good idea to a successful citizen science game remains highly challenging. Apart from the scientific difficulties of identifying suitable problems and appropriate human-powered solutions, the games still need to be created, need to be fun, and need to reach a large audience that remain engaged for the long-term. Here, we describe Science Game Lab (SGL) (https://sciencegamelab.org), a platform for bootstrapping the production, facilitating the publication, and boosting both the fun and the value of the user experience for scientific games with a purpose.

bioinformatics↗