Papers › Interpretable RNA Foundation Model from Unannotated Data for Highly Accurate RNA...

Interpretable RNA Foundation Model from Unannotated Data for Highly Accurate RNA Structure and Function Predictions

1 Apr 2022arXiv:2204.00300archive 2025-07-28

Jiayang Chen, Zhihang Hu, Siqi Sun, Qingxiong Tan, YiXuan Wang, Qinze Yu, Licheng Zong, Liang Hong, Jin Xiao, Tao Shen, Irwin King, Yu Li

Non-coding RNA structure and function are essential to understanding various biological processes, such as cell signaling, gene expression, and post-transcriptional regulations. These are all among the core problems in the RNA field. With the rapid growth of sequencing technology, we have accumulated a massive amount of unannotated RNA sequences. On the other hand, expensive experimental observatory results in only limited numbers of annotated data and 3D structures. Hence, it is still challenging to design computational methods for predicting their structures and functions. The lack of annotated data and systematic study causes inferior performance. To resolve the issue, we propose a novel RNA foundation model (RNA-FM) to take advantage of all the 23 million non-coding RNA sequences through self-supervised learning. Within this approach, we discover that the pre-trained RNA-FM could infer sequential and evolutionary information of non-coding RNAs without using any labels. Furthermore, we demonstrate RNA-FM's effectiveness by applying it to the downstream secondary/3D structure prediction, SARS-CoV-2 genome structure and evolution prediction, protein-RNA binding preference modeling, and gene expression regulation modeling. The comprehensive experiments show that the proposed method improves the RNA structural and functional modelling results significantly and consistently. Despite only being trained with unlabelled data, RNA-FM can serve as the foundational model for the field.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2204.00300")

Code

Syntology Ran 1 of 14 code samples harvested from 2 repositories linked to this paper; 13 have no recorded run. Of those that ran: 1 ran · honoured contract.

By repository: official repository: 2 samples from 1 repository, 1 ran; community (archive-listed): 12 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

ml4bio/rna-fm officialmentioned in papermentioned on GitHubpytorch report
cgoliver/rnaglib mentioned on GitHubpytorchMIT report
lulab/OligoFormer mentioned on GitHubNOASSERTION report
sinc-lab/rna-llm-folding mentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 1 ran; 1 honoured the contract we drafted; 13 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
13unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

generate_token_batch ml4bio/rna-fm/tutorials/utr-function-prediction/UTR-Function-Prediction.py official repository ran · honoured contract MIT (permissive) · 8f1f5da056a32fd2 · report
collate_fn ml4bio/rna-fm/tutorials/utr-function-prediction/UTR-Function-Prediction.py official repository unverified MIT (permissive) · 1c08c07ffb61187a · report
get_ged_hashtable cgoliver/rnaglib/src/rnaglib/algorithms/graphlet_hash.py community (archive-listed) unverified MIT (permissive) · fd34c0dce5de1bb8 · report
graph_edge_freqs cgoliver/rnaglib/src/rnaglib/algorithms/node_sim.py community (archive-listed) unverified MIT (permissive) · 32edbf8e1d25ead4 · report
internal_coords cgoliver/rnaglib/src/rnaglib/algorithms/gvp_algos.py community (archive-listed) unverified MIT (permissive) · e00716bd682a1155 · report
k_block_list cgoliver/rnaglib/src/rnaglib/algorithms/node_sim.py community (archive-listed) unverified MIT (permissive) · 3f39c6320f13a303 · report
multigraph_to_simple cgoliver/rnaglib/src/rnaglib/algorithms/graph_algos.py community (archive-listed) unverified MIT (permissive) · f082f528ee690b5e · report
normed_cross cgoliver/rnaglib/src/rnaglib/algorithms/gvp_algos.py community (archive-listed) unverified MIT (permissive) · 355820f1747d1f20 · report
normed_vec cgoliver/rnaglib/src/rnaglib/algorithms/gvp_algos.py community (archive-listed) unverified MIT (permissive) · df99b73d3612b618 · report
parse_cif cgoliver/rnaglib/src/rnaglib/config/generate_modifications_cache.py community (archive-listed) unverified MIT (permissive) · 062fa3842da76999 · report
parse_cif_string cgoliver/rnaglib/src/rnaglib/config/generate_modifications_cache.py community (archive-listed) unverified MIT (permissive) · c2aec72c0fc7d532 · report
pdist_list cgoliver/rnaglib/src/rnaglib/algorithms/node_sim.py community (archive-listed) unverified MIT (permissive) · 0e37ee25d62c009b · report
remove_noncanonical_edges cgoliver/rnaglib/src/rnaglib/algorithms/graph_algos.py community (archive-listed) unverified MIT (permissive) · 13f4c774f0d9d7e5 · report
reorder_nodes cgoliver/rnaglib/src/rnaglib/algorithms/graph_algos.py community (archive-listed) unverified MIT (permissive) · ffdd5867d61d4d31 · report

Tasks

Self-Supervised Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections