Biology – Quantitative Biology – Quantitative Methods
Scientific paper
2011-06-19
11th Workshop on Algorithms in Bioinformatics (WABI'11) (2011)
Biology
Quantitative Biology
Quantitative Methods
Scientific paper
We extend an hypergraph representation, introduced by Finkelstein and Roytberg, to unify dynamic programming algorithms in the context of RNA folding with pseudoknots. Classic applications of RNA dynamic programming energy minimization, partition function, base-pair probabilities...) are reformulated within this framework, giving rise to very simple algorithms. This reformulation allows one to conceptually detach the conformation space/energy model -- captured by the hypergraph model -- from the specific application, assuming unambiguity of the decomposition. To ensure the latter property, we propose a new combinatorial methodology based on generating functions. We extend the set of generic applications by proposing an exact algorithm for extracting generalized moments in weighted distribution, generalizing a prior contribution by Miklos and al. Finally, we illustrate our full-fledged programme on three exemplary conformation spaces (secondary structures, Akutsu's simple type pseudoknots and kissing hairpins). This readily gives sets of algorithms that are either novel or have complexity comparable to classic implementations for minimization and Boltzmann ensemble applications of dynamic programming.
Ponty Yann
Saule Cédric
No associations
LandOfFree
A Combinatorial Framework for Designing (Pseudoknotted) RNA Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Combinatorial Framework for Designing (Pseudoknotted) RNA Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Combinatorial Framework for Designing (Pseudoknotted) RNA Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-723337