Cargando…

Detecting riboSNitches with RNA folding algorithms: a genome-wide benchmark

Ribonucleic acid (RNA) secondary structure prediction continues to be a significant challenge, in particular when attempting to model sequences with less rigidly defined structures, such as messenger and non-coding RNAs. Crucial to interpreting RNA structures as they pertain to individual phenotypes...

Descripción completa

Detalles Bibliográficos
Autores principales: Corley, Meredith, Solem, Amanda, Qu, Kun, Chang, Howard Y., Laederach, Alain
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Oxford University Press 2015
Materias:
RNA
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4330374/
https://www.ncbi.nlm.nih.gov/pubmed/25618847
http://dx.doi.org/10.1093/nar/gkv010
_version_ 1782357575465959424
author Corley, Meredith
Solem, Amanda
Qu, Kun
Chang, Howard Y.
Laederach, Alain
author_facet Corley, Meredith
Solem, Amanda
Qu, Kun
Chang, Howard Y.
Laederach, Alain
author_sort Corley, Meredith
collection PubMed
description Ribonucleic acid (RNA) secondary structure prediction continues to be a significant challenge, in particular when attempting to model sequences with less rigidly defined structures, such as messenger and non-coding RNAs. Crucial to interpreting RNA structures as they pertain to individual phenotypes is the ability to detect RNAs with large structural disparities caused by a single nucleotide variant (SNV) or riboSNitches. A recently published human genome-wide parallel analysis of RNA structure (PARS) study identified a large number of riboSNitches as well as non-riboSNitches, providing an unprecedented set of RNA sequences against which to benchmark structure prediction algorithms. Here we evaluate 11 different RNA folding algorithms’ riboSNitch prediction performance on these data. We find that recent algorithms designed specifically to predict the effects of SNVs on RNA structure, in particular remuRNA, RNAsnp and SNPfold, perform best on the most rigorously validated subsets of the benchmark data. In addition, our benchmark indicates that general structure prediction algorithms (e.g. RNAfold and RNAstructure) have overall better performance if base pairing probabilities are considered rather than minimum free energy calculations. Although overall aggregate algorithmic performance on the full set of riboSNitches is relatively low, significant improvement is possible if the highest confidence predictions are evaluated independently.
format Online
Article
Text
id pubmed-4330374
institution National Center for Biotechnology Information
language English
publishDate 2015
publisher Oxford University Press
record_format MEDLINE/PubMed
spelling pubmed-43303742015-03-18 Detecting riboSNitches with RNA folding algorithms: a genome-wide benchmark Corley, Meredith Solem, Amanda Qu, Kun Chang, Howard Y. Laederach, Alain Nucleic Acids Res RNA Ribonucleic acid (RNA) secondary structure prediction continues to be a significant challenge, in particular when attempting to model sequences with less rigidly defined structures, such as messenger and non-coding RNAs. Crucial to interpreting RNA structures as they pertain to individual phenotypes is the ability to detect RNAs with large structural disparities caused by a single nucleotide variant (SNV) or riboSNitches. A recently published human genome-wide parallel analysis of RNA structure (PARS) study identified a large number of riboSNitches as well as non-riboSNitches, providing an unprecedented set of RNA sequences against which to benchmark structure prediction algorithms. Here we evaluate 11 different RNA folding algorithms’ riboSNitch prediction performance on these data. We find that recent algorithms designed specifically to predict the effects of SNVs on RNA structure, in particular remuRNA, RNAsnp and SNPfold, perform best on the most rigorously validated subsets of the benchmark data. In addition, our benchmark indicates that general structure prediction algorithms (e.g. RNAfold and RNAstructure) have overall better performance if base pairing probabilities are considered rather than minimum free energy calculations. Although overall aggregate algorithmic performance on the full set of riboSNitches is relatively low, significant improvement is possible if the highest confidence predictions are evaluated independently. Oxford University Press 2015-02-18 2015-01-23 /pmc/articles/PMC4330374/ /pubmed/25618847 http://dx.doi.org/10.1093/nar/gkv010 Text en © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research. http://creativecommons.org/licenses/by/4.0/ This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle RNA
Corley, Meredith
Solem, Amanda
Qu, Kun
Chang, Howard Y.
Laederach, Alain
Detecting riboSNitches with RNA folding algorithms: a genome-wide benchmark
title Detecting riboSNitches with RNA folding algorithms: a genome-wide benchmark
title_full Detecting riboSNitches with RNA folding algorithms: a genome-wide benchmark
title_fullStr Detecting riboSNitches with RNA folding algorithms: a genome-wide benchmark
title_full_unstemmed Detecting riboSNitches with RNA folding algorithms: a genome-wide benchmark
title_short Detecting riboSNitches with RNA folding algorithms: a genome-wide benchmark
title_sort detecting ribosnitches with rna folding algorithms: a genome-wide benchmark
topic RNA
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4330374/
https://www.ncbi.nlm.nih.gov/pubmed/25618847
http://dx.doi.org/10.1093/nar/gkv010
work_keys_str_mv AT corleymeredith detectingribosnitcheswithrnafoldingalgorithmsagenomewidebenchmark
AT solemamanda detectingribosnitcheswithrnafoldingalgorithmsagenomewidebenchmark
AT qukun detectingribosnitcheswithrnafoldingalgorithmsagenomewidebenchmark
AT changhowardy detectingribosnitcheswithrnafoldingalgorithmsagenomewidebenchmark
AT laederachalain detectingribosnitcheswithrnafoldingalgorithmsagenomewidebenchmark