Evidence map›Paper›PMID 29110632›Full record

ArticleBMC bioinformatics2017

RNA inverse folding using Monte Carlo tree search.

Xiufeng Yang, Kazuki Yoshizoe, Akito Taneda, Koji Tsuda

Abstract read
In one paragraph

Article in BMC bioinformatics, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing 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

13 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Datasets for Benchmarking RNA Design Algorithms.Methods in molecular biology (Clifton, N.J.) · 2025
    Article
  6. Article
  7. Article
  8. Article
  9. Partial RNA design.Bioinformatics (Oxford, England) · 2024
    Article
  10. Article
  11. Fitness functions for RNA structure design.Nucleic acids research · 2023
    Article
  12. Article
  13. 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.

Xiufeng YangDepartment of Computational Biology and Medical Sciences, Graduate School of Frontier Sciences, The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, 277-8561, Japan.
Kazuki YoshizoeRIKEN Center for Advanced Intelligence Project, 1-4-1 Nihombashi Chuo-ku, Tokyo, 103-0027, Japan.
Akito TanedaGraduate School of Science and Technology, Hirosaki University, 3 Bunkyo-cho, Hirosaki, 036-8561, Japan.
Koji TsudaDepartment of Computational Biology and Medical Sciences, Graduate School of Frontier Sciences, The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, 277-8561, Japan. tsuda@k.u-tokyo.ac.jp.ORCID http://orcid.org/0000-0002-4288-1606

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundArtificially synthesized RNA molecules provide important ways for creating a variety of novel functional molecules. State-of-the-art RNA inverse folding algorithms can design simple and short RNA sequences of specific GC content, that fold into the target RNA structure. However, their performance is not satisfactory in complicated cases.

resultWe present a new inverse folding algorithm called MCTS-RNA, which uses Monte Carlo tree search (MCTS), a technique that has shown exceptional performance in Computer Go recently, to represent and discover the essential part of the sequence space. To obtain high accuracy, initial sequences generated by MCTS are further improved by a series of local updates. Our algorithm has an ability to control the GC content precisely and can deal with pseudoknot structures. Using common benchmark datasets for evaluation, MCTS-RNA showed a lot of promise as a standard method of RNA inverse folding.

conclusionMCTS-RNA is available at https://github.com/tsudalab/MCTS-RNA .

Indexed as

AlgorithmsInternetMonte Carlo MethodNucleic Acid ConformationRNARNA FoldingSequence Analysis, RNAUser-Computer InterfaceRNALocal updateMonte Carlo tree searchPseudoknotted structureRNA inverse folding

Identifiers

PMID29110632
PMCPMC5674771

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.