Skip to content
naulon

Not checkedNot checked for notices yet.

aRNAque: an evolutionary algorithm for inverse pseudoknotted RNA folding inspired by Lévy flights

Nono S. C. Merleau, Matteo Smerlak

BMC Bioinformatics · 2022

doi:10.1186/s12859-022-04866-w (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Abstract Background We study in this work the inverse folding problem for RNA, which is the discovery of sequences that fold into given target secondary structures. Results We implement a Lévy mutation scheme in an updated version of aRNAque an evolutionary inverse folding algorithm and apply it to the design of RNAs with and without pseudoknots. We find that the Lévy mutation scheme increases the diversity of designed RNA sequences and reduces the average number of evaluations of the evolutionary algorithm. Compared to antaRNA, aRNAque CPU time is higher but more successful in finding designed sequences that fold correctly into the target structures. Conclusion We propose that a Lévy flight offers a better standard mutation scheme for optimizing RNA design. Our new version of aRNAque is available on GitHub as a python script and the benchmark results show improved performance on both Pseudobase++ and the Eterna100 datasets, compared to existing inverse folding tools.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.