The Montparnasse Algorithm for RNA Design
Not on the map. Why?
Abstract (arXiv)
RNA design consists of discovering a nucleotide sequence that optimizes predefined criteria, such as secondary structure. It is useful for synthetic biology, medicine, and nanotechnology. We propose Montparnasse, a Monte Carlo search framework based on Generalized Nested Rollout Policy Adaptation, augmented with a problem-specific prior, slow and long adaptation at level 1, and a lexicographic multicriteria evaluation. Montparnasse solves all 100 puzzles of the Eterna100 V1 benchmark consistently faster than DesiRNA, the previous state of the art, across all time limits, reaching full coverage more than three times faster overall. On messenger RNA secondary structure optimization for hemoglobin alpha, it identifies sequences with more paired bases than the MFE-optimal solution of LinearDesign.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 24 references that are in the map. First posted on arXiv 25 May 2026.
Builds on
5 of 24 references.
References · 5
- 2017Designing RNA Secondary Structures is Hardcited by 15
- 2020Generalized Nested Rollout Policy Adaptationcited by 9
- 2020Monte Carlo Inverse Foldingcited by 5
- 2024Learning a Prior for Monte Carlo Search by Replaying Solutions to Combinatorial Problemscited by 4
- 2024Generalized Nested Rollout Policy Adaptation with Limited Repetitionscited by 3
Built on by
Not cited yet.