LinearFold : linear-time approximate RNA folding by 5'-to-3' dynamic programming and beam search
© The Author(s) 2019. Published by Oxford University Press..
MOTIVATION: Predicting the secondary structure of an ribonucleic acid (RNA) sequence is useful in many applications. Existing algorithms [based on dynamic programming] suffer from a major limitation: their runtimes scale cubically with the RNA length, and this slowness limits their use in genome-wide applications.
RESULTS: We present a novel alternative O(n3)-time dynamic programming algorithm for RNA folding that is amenable to heuristics that make it run in O(n) time and O(n) space, while producing a high-quality approximation to the optimal solution. Inspired by incremental parsing for context-free grammars in computational linguistics, our alternative dynamic programming algorithm scans the sequence in a left-to-right (5'-to-3') direction rather than in a bottom-up fashion, which allows us to employ the effective beam pruning heuristic. Our work, though inexact, is the first RNA folding algorithm to achieve linear runtime (and linear space) without imposing constraints on the output structure. Surprisingly, our approximate search results in even higher overall accuracy on a diverse database of sequences with known structures. More interestingly, it leads to significantly more accurate predictions on the longest sequence families in that database (16S and 23S Ribosomal RNAs), as well as improved accuracies for long-range base pairs (500+ nucleotides apart), both of which are well known to be challenging for the current models.
AVAILABILITY AND IMPLEMENTATION: Our source code is available at https://github.com/LinearFold/LinearFold, and our webserver is at http://linearfold.org (sequence limit: 100 000nt).
SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2019 |
|---|---|
| Erschienen: |
2019 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:35 |
|---|---|
| Enthalten in: |
Bioinformatics (Oxford, England) - 35(2019), 14 vom: 15. Juli, Seite i295-i304 |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Huang, Liang [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
63231-63-0 |
|---|
| Anmerkungen: |
Date Completed 12.06.2020 Date Revised 04.11.2023 published: Print Citation Status MEDLINE |
|---|
| doi: |
10.1093/bioinformatics/btz375 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM301193169 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM301193169 | ||
| 003 | DE-627 | ||
| 005 | 20231225104123.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231225s2019 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1093/bioinformatics/btz375 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1003.xml |
| 035 | |a (DE-627)NLM301193169 | ||
| 035 | |a (NLM)31510672 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Huang, Liang |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a LinearFold |b linear-time approximate RNA folding by 5'-to-3' dynamic programming and beam search |
| 264 | 1 | |c 2019 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Completed 12.06.2020 | ||
| 500 | |a Date Revised 04.11.2023 | ||
| 500 | |a published: Print | ||
| 500 | |a Citation Status MEDLINE | ||
| 520 | |a © The Author(s) 2019. Published by Oxford University Press. | ||
| 520 | |a MOTIVATION: Predicting the secondary structure of an ribonucleic acid (RNA) sequence is useful in many applications. Existing algorithms [based on dynamic programming] suffer from a major limitation: their runtimes scale cubically with the RNA length, and this slowness limits their use in genome-wide applications | ||
| 520 | |a RESULTS: We present a novel alternative O(n3)-time dynamic programming algorithm for RNA folding that is amenable to heuristics that make it run in O(n) time and O(n) space, while producing a high-quality approximation to the optimal solution. Inspired by incremental parsing for context-free grammars in computational linguistics, our alternative dynamic programming algorithm scans the sequence in a left-to-right (5'-to-3') direction rather than in a bottom-up fashion, which allows us to employ the effective beam pruning heuristic. Our work, though inexact, is the first RNA folding algorithm to achieve linear runtime (and linear space) without imposing constraints on the output structure. Surprisingly, our approximate search results in even higher overall accuracy on a diverse database of sequences with known structures. More interestingly, it leads to significantly more accurate predictions on the longest sequence families in that database (16S and 23S Ribosomal RNAs), as well as improved accuracies for long-range base pairs (500+ nucleotides apart), both of which are well known to be challenging for the current models | ||
| 520 | |a AVAILABILITY AND IMPLEMENTATION: Our source code is available at https://github.com/LinearFold/LinearFold, and our webserver is at http://linearfold.org (sequence limit: 100 000nt) | ||
| 520 | |a SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online | ||
| 650 | 4 | |a Journal Article | |
| 650 | 4 | |a Research Support, N.I.H., Extramural | |
| 650 | 4 | |a Research Support, U.S. Gov't, Non-P.H.S. | |
| 650 | 7 | |a RNA |2 NLM | |
| 650 | 7 | |a 63231-63-0 |2 NLM | |
| 700 | 1 | |a Zhang, He |e verfasserin |4 aut | |
| 700 | 1 | |a Deng, Dezhong |e verfasserin |4 aut | |
| 700 | 1 | |a Zhao, Kai |e verfasserin |4 aut | |
| 700 | 1 | |a Liu, Kaibo |e verfasserin |4 aut | |
| 700 | 1 | |a Hendrix, David A |e verfasserin |4 aut | |
| 700 | 1 | |a Mathews, David H |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Bioinformatics (Oxford, England) |d 1998 |g 35(2019), 14 vom: 15. Juli, Seite i295-i304 |w (DE-627)NLM094620342 |x 1367-4811 |7 nnns |
| 773 | 1 | 8 | |g volume:35 |g year:2019 |g number:14 |g day:15 |g month:07 |g pages:i295-i304 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.1093/bioinformatics/btz375 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 35 |j 2019 |e 14 |b 15 |c 07 |h i295-i304 | ||