Cargando…
RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform
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 stru...
Autores principales: | , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9455880/ https://www.ncbi.nlm.nih.gov/pubmed/36026505 http://dx.doi.org/10.1371/journal.pcbi.1010448 |
_version_ | 1784785676957384704 |
---|---|
author | Opuu, Vaitea Merleau, Nono S. C. Messow, Vincent Smerlak, Matteo |
author_facet | Opuu, Vaitea Merleau, Nono S. C. Messow, Vincent Smerlak, Matteo |
author_sort | Opuu, Vaitea |
collection | PubMed |
description | 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 [Image: see text] . |
format | Online Article Text |
id | pubmed-9455880 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2022 |
publisher | Public Library of Science |
record_format | MEDLINE/PubMed |
spelling | pubmed-94558802022-09-09 RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform Opuu, Vaitea Merleau, Nono S. C. Messow, Vincent Smerlak, Matteo PLoS Comput Biol Research Article 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 [Image: see text] . Public Library of Science 2022-08-26 /pmc/articles/PMC9455880/ /pubmed/36026505 http://dx.doi.org/10.1371/journal.pcbi.1010448 Text en © 2022 Opuu et al https://creativecommons.org/licenses/by/4.0/This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/) , which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. |
spellingShingle | Research Article Opuu, Vaitea Merleau, Nono S. C. Messow, Vincent Smerlak, Matteo RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform |
title | RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform |
title_full | RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform |
title_fullStr | RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform |
title_full_unstemmed | RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform |
title_short | RAFFT: Efficient prediction of RNA folding pathways using the fast Fourier transform |
title_sort | rafft: efficient prediction of rna folding pathways using the fast fourier transform |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9455880/ https://www.ncbi.nlm.nih.gov/pubmed/36026505 http://dx.doi.org/10.1371/journal.pcbi.1010448 |
work_keys_str_mv | AT opuuvaitea rafftefficientpredictionofrnafoldingpathwaysusingthefastfouriertransform AT merleaunonosc rafftefficientpredictionofrnafoldingpathwaysusingthefastfouriertransform AT messowvincent rafftefficientpredictionofrnafoldingpathwaysusingthefastfouriertransform AT smerlakmatteo rafftefficientpredictionofrnafoldingpathwaysusingthefastfouriertransform |