activity
20232026
most citedUndesignable RNA Structure Identification via Rival Structure Generation and Structure Decomposition

5 citations · 8 across the 9 of their papers we have counts for

collaborators

9 papers

q-bio.BM2026

Fast and Versatile RNA Design via Motif-level Divide-and-Conquer and Structure-level Rival Search

Tianshuo Zhou, David H. Mathews, Liang Huang

RNA design aims to identify RNA sequences that fold into a target secondary structure. This task is challenging in terms of computational efficiency. Most existing methods focus on…

cs.LG2026

Designing RNAs with Language Models

Milan Gautam, Ning Dai, Tianshuo Zhou +3

RNA design, the task of finding a sequence that folds into a target secondary structure, has broad biological and biomedical impact but remains computationally challenging due to t…

cs.DS2026

Probabilistic RNA Designability via Interpretable Ensemble Approximation and Dynamic Decomposition

Tianshuo Zhou, David H. Mathews, Liang Huang

Motivation: RNA design aims to find RNA sequences that fold into a given target secondary structure, a problem also known as RNA inverse folding. However, not all target structures…

cs.LG2026

ECCO: Evidence-Driven Causal Reasoning for Compiler Optimization

Haolin Pan, Lianghong Huang, Jinyuan Dong +2

Compiler auto-tuning faces a dichotomy between traditional black-box search methods, which lack semantic guidance, and recent Large Language Model (LLM) approaches, which often suf…

cs.CV2025

Geometry-Aware Losses for Structure-Preserving Text-to-Sign Language Generation

Zetian Wu, Tianshuo Zhou, Stefan Lee +1

Sign language translation from text to video plays a crucial role in enabling effective communication for Deaf and hard--of--hearing individuals. A major challenge lies in generati…

q-bio.BM2024

Sampling-based Continuous Optimization with Coupled Variables for RNA Design

Wei Yu Tang, Ning Dai, Tianshuo Zhou +2

The task of RNA design given a target structure aims to find a sequence that can fold into that structure. It is a computationally hard problem where some version(s) have been prov…

q-bio.BM2024★ 1 cited

Messenger RNA Design via Expected Partition Function and Continuous Optimization

Ning Dai, Wei Yu Tang, Tianshuo Zhou +2

The tasks of designing RNAs are discrete optimization problems, and several versions of these problems are NP-hard. As an alternative to commonly used local search methods, we form…

cs.DS2024★ 2 cited

Scalable and Interpretable Identification of Minimal Undesignable RNA Structure Motifs with Rotational Invariance

Tianshuo Zhou, Wei Yu Tang, Apoorv Malik +2

RNA design aims to find a sequence that folds with highest probability into a designated target structure. However, certain structures are undesignable, meaning no sequence can fol…

q-bio.BM2023★ 5 cited

Undesignable RNA Structure Identification via Rival Structure Generation and Structure Decomposition

Tianshuo Zhou, Wei Yu Tang, David H. Mathews +1

RNA design is the search for a sequence or set of sequences that will fold into predefined structures, also known as the inverse problem of RNA folding. While numerous RNA design m…