Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 12372-12383· 0 citations· 47 references
TL;DR
GALS-Fold is proposed, a Geometry-Aware Long-Short framework that reconciles local geometric fidelity with efficient global context, and achieves state-of-the-art performance on long sequences, reaching an average recovery rate of 52.2% on long sequences.
Abstract
RNA inverse folding aims to design nucleotide sequences that adopt a prescribed 3D backbone, enabling programmable non-coding RNAs (ncRNAs) for therapeutics and synthetic biology. However, scaling 3D structure-guided design to long RNAs remains challenging due to a key trade-off we term the ''Long RNA Dilemma'': graph neural networks (GNNs) are efficient and capture local motifs but struggle to propagate long-range tertiary constraints, while Transformer-style global attention can model distant couplings but incurs prohibitive O(N2) time and memory and may dilute local geometric signals. We propose GALS-Fold, a Geometry-Aware Long-Short framework that reconciles local geometric fidelity with efficient global context. GALS-Fold combines an SE(3)-equivariant GNN based short-range encoder with a linear-time long-range module based on anchor attention. To ensure the long branch focuses on non-local information, we introduce a local exclusion regularization that discourages adjacent nucleotides from sharing the same anchors. We finally fuse long and short features with a length-aware gating strategy. Extensive evaluations on a rigorous 5-fold structural split demonstrate that GALS-Fold achieves state-of-the-art performance, reaching an average recovery rate of 52.2% (SOTA baseline 48.0%). On long sequences (>200 nt), GALS-Fold attains 62.4% recovery, outperforming strong baselines such as gRNAde (57.7%) and Graphormer (45.6%). Our code is available at: https://github.com/wenxy59/GALS-Fold.
RIFT-VAE is best interpreted as a hybrid generative-search framework: pretraining supplies a structure- and family-informed proposal distribution, whereas latent optimization concentrates evaluations in high-scoring regions.
Frozen RNA-type evaluations show that RIBOSPAN learns state-of-the-art RNA representations, with a particularly clear advantage on long RNAs, and emerges as the strongest encoder-only RNA foundation model, achieving state-of-the-art performance in both full-transcript biological property prediction and zero-shot mutati...
Ziyuan Wang, Bo-Hao Tang, Fei Zhang et al.· 0 citations
This work introduces a symmetric dual-path architecture that both leverages PLMs for pretrained sequence evolution knowledge and MPLMs for pretrained structural knowledge to iteratively guide protein sequence generation.
Han-Dong Wang, Jiaxin Qi, Baisheng Lai et al.· 0 citations
Designing functional non-coding RNA (ncRNA) is fundamental to synthetic biology and RNA therapeutics, yet generative modelling for ncRNA has received far less attention than protein design. We present RNA-MDLM, a framework that extends Masked Discrete Language Models (MDLM) to the conditional generation and inpainting...
Fixed-backbone sequence discovery, or inverse folding, is a critical recurring task in the development of new polypeptide therapeutics. Once promising backbones are established for a target pocket, computational inverse folding methods greatly help accelerate generation of candidate sequences. Such methods are mature f...
A. Kitaygorodsky, D. E. Hostallero, Aron Broom et al.· bioRxiv· 0 citations
Ribonucleic acid (RNA) functions through conformational changes that are not fully captured by static structures. However, large-scale standardized RNA dynamics data remain limited, and existing approaches typically treat trajectory generation and dynamics understanding as separate objectives. Here, we introduce RNADyn...
Yi-Ming Huang, L. Bastian, Hanqun Cao et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.