PLoS Computational Biology (Aug 2022)

RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform.

  • Vaitea Opuu,
  • Nono S C Merleau,
  • Vincent Messow,
  • Matteo Smerlak

DOI
https://doi.org/10.1371/journal.pcbi.1010448
Journal volume & issue
Vol. 18, no. 8
p. e1010448

Abstract

Read online

We propose a novel heuristic to predict RNA secondary structure formation pathways that has two components: (i) a folding algorithm and (ii) a kinetic ansatz. This heuristic is inspired by the kinetic partitioning mechanism, by which molecules follow alternative folding pathways to their native structure, some much faster than others. Similarly, our algorithm RAFFT starts by generating an ensemble of concurrent folding pathways ending in multiple metastable structures, which is in contrast with traditional thermodynamic approaches that find single structures with minimal free energies. When we constrained the algorithm to predict only 50 structures per sequence, near-native structures were found for RNA molecules of length ≤ 200 nucleotides. Our heuristic has been tested on the coronavirus frameshifting stimulation element (CFSE): an ensemble of 68 distinct structures allowed us to produce complete folding kinetic trajectories, whereas known methods require evaluating millions of sub-optimal structures to achieve this result. Thanks to the fast Fourier transform on which RAFFT (RNA folding Algorithm wih Fast Fourier Transform) is based, these computations are efficient, with complexity [Formula: see text].