# Monte Carlo Inverse Folding

arXiv: https://arxiv.org/abs/2005.09961 · HTML: https://mlsanity.com/paper/2005.09961/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 May 2020.

## Built on by (most cited first, 5 of 5)

- [Learning a Prior for Monte Carlo Search by Replaying Solutions to Combinatorial Problems](https://mlsanity.com/paper/2401.10431/) (2024)
- [Generalized Nested Rollout Policy Adaptation with Limited Repetitions](https://mlsanity.com/paper/2401.10420/) (2024)
- [The Montparnasse Algorithm for RNA Design](https://mlsanity.com/paper/2606.07562/) (2026)
- [Nested Search versus Limited Discrepancy Search](https://mlsanity.com/paper/2210.00216/) (2022)
- [Eterna is Solved](https://mlsanity.com/paper/2505.02110/) (2025)

## Abstract (arXiv)

The RNA Inverse Folding problem comes from computational biology. The goal is to find a molecule that has a given folding. It is important for scientific fields such as bioengineering, pharmaceutical research, biochemistry, synthetic biology and RNA nanostructures. Nested Monte Carlo Search has given excellent results for this problem. We propose to adapt and evaluate different Monte Carlo Search algorithms for the RNA Inverse Folding problem.