Evidence map›Paper›PMID 41137157›Full record

ArticleAlgorithms for molecular biology : AMB2025

RNA inverse folding can be solved in linear time for structures without isolated stacks or base pairs.

Théo Boury, Samuel Gardelle, Laurent Bulteau, Yann Ponty

Abstract read
In one paragraph

Article in Algorithms for molecular biology : AMB, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Review
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Théo BouryLaboratoire d'Informatique de l'Ecole Polytechnique (LIX CNRS UMR 7161), Institut Polytechnique de Paris, 1 Rue Honoré d'Estienne d'Orves, 91120, Palaiseau, France.ORCID https://orcid.org/0009-0004-0553-4789
Samuel GardelleLaboratoire d'Informatique de l'Ecole Polytechnique (LIX CNRS UMR 7161), Institut Polytechnique de Paris, 1 Rue Honoré d'Estienne d'Orves, 91120, Palaiseau, France.ORCID https://orcid.org/0009-0003-6766-2383
Laurent BulteauLaboratoire d'Informatique Gaspard Monge (LIGM CNRS UMR 8049), Université Gustave Eiffel, 5 Boulevard Descartes - Champs sur Marne, 77454, Marne La Vallée, France. laurent.bulteau@univ-eiffel.fr.ORCID https://orcid.org/0000-0003-1645-9345
Yann PontyLaboratoire d'Informatique de l'Ecole Polytechnique (LIX CNRS UMR 7161), Institut Polytechnique de Paris, 1 Rue Honoré d'Estienne d'Orves, 91120, Palaiseau, France. yann.ponty@lix.polytechnique.fr.ORCID https://orcid.org/0000-0002-7615-3930

Funding

Agence Nationale de la Recherche ANR-19-CE30-0021
6 · The paper itself

Abstract

Inverse folding is a classic instance of negative RNA design which consists in finding a sequence that uniquely folds into a target secondary structure with respect to energy minimization. A breakthrough result of Bonnet et al. shows that, even in simple base pairs-based (BP) models, the decision version of a mildly constrained version of inverse folding is NP-hard. In this work, we show that inverse folding can be solved in linear time for a large collection of targets, including every structure that contains no isolated BP and no isolated stack (or, equivalently, when all helices consist of

Indexed as

Parameterized complexityRNA structureString designUniform sampling

Identifiers

PMID41137157
PMCPMC12553252

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.