Factorization machine with quadratic-optimization annealing for RNA inverse folding and evaluation of binary-integer encoding and nucleotide assignment
Shuta Kikuchi, Shu Tanaka · 2026
Read Factorization machine with quadratic-optimization annealing for RNA inverse folding and evaluation of binary-integer encoding and nucleotide assignment by Shuta Kikuchi, Shu Tanaka (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-13328549.txt.
Description
Shuta Kikuchi and Shu Tanaka apply a quantum-linked search method to RNA design in a 2026 paper. The design task, called RNA inverse folding, asks which letter sequence will fold into a chosen shape. Many past methods need huge numbers of test sequences, which hurts when lab checks are costly.
Their method pairs a learning model called a factorization machine with an annealing search that suits discrete choices. It is known for finding good answers with few evaluations. To use it, the RNA letters must be coded as numbers, and the paper compares coding schemes and letter assignments. The work offers chemists a design route that spends its lab budget on the most promising sequences.
Catalog record
| CREATOR | Shuta Kikuchi, Shu Tanaka |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 69 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |