Approximating the set of local minima in partial RNA folding landscapes

Sahoo, Sudhakar and Albrecht, Andreas A. (2012) Approximating the set of local minima in partial RNA folding landscapes. Bioinformatics, 28 (4) . pp. 523-530. ISSN 1367-4803 [Article] (doi:10.1093/bioinformatics/btr715)

Abstract

Motivation: We study a stochastic method for approximating the set of local minima in partial RNA folding landscapes associated with a bounded-distance neighbourhood of folding conformations. The conformations are limited to RNA secondary structures without pseudoknots. The method aims at exploring partial energy landscapes pL induced by folding simulations and their underlying neighbourhood relations. It combines an approximation of the number of local optima devised by Garnier and Kallel (2002) with a run-time estimation for identifying sets of local optima established by Reeves and Eremeev (2004).

Results: The method is tested on nine sequences of length between 50 nt and 400 nt, which allows us to compare the results with data generated by RNAsubopt and subsequent barrier tree calculations. On the nine sequences, the method captures on average 92% of local minima with settings designed for a target of 95%. The run-time of the heuristic can be estimated by O(n2Dνlnν), where n is the sequence length, ν is the number of local minima in the partial landscape pL under consideration and D is the maximum number of steepest descent steps in attraction basins associated with pL.

Item Type: Article
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 11128
Depositing User: Teddy ~
Date Deposited: 03 Jul 2013 09:50
Last Modified: 12 Jun 2019 12:27
URI: https://eprints.mdx.ac.uk/id/eprint/11128

Actions (login required)

View Item View Item