Abstract

Abstract Summary: The genome-wide search for non-coding RNAs requires efficient methods to compute and compare local secondary structures. Since the exact boundaries of such putative transcripts are typically unknown, arbitrary sequence windows have to be used in practice. Here we present a method for robustly computing the probabilities of local base pairs from long RNA sequences independent of the exact positions of the sequence window. Availability: The program RNAplfold is part of the Vienna RNA Package and can be downloaded from Contact: ivo@tbi.univie.ac.at

Keywords

RNABase pairSequence (biology)Base (topology)Coding (social sciences)Computer scienceGenomeComputational biologyAlgorithmGeneticsTheoretical computer scienceBiologyMathematicsDNAGeneStatistics

Affiliated Institutions

Related Publications

Publication Info

Year
2005
Type
article
Volume
22
Issue
5
Pages
614-615
Citations
236
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

236
OpenAlex

Cite This

Stephan Wolf, Ivo L. Hofacker, Peter F. Stadler (2005). Local RNA base pairing probabilities in large sequences. Bioinformatics , 22 (5) , 614-615. https://doi.org/10.1093/bioinformatics/btk014

Identifiers

DOI
10.1093/bioinformatics/btk014