RNA folding via algebraic dynamic programming

The aim of this thesis is to apply the framework of Algebraic Dynamic Programming (short ADP) to a well known problem with established significance in bioinformatics, to implement the current "state of the art", and finally to go one step further and solve one of the open problems. Ab initio RNA secondary structure folding of a single sequence was chosen as a perfect fit to the requirements. First, because of the compactness of the field, showing a clear path from the first description of the Nearest Neighbor model by Tinoco and others in a Nature paper from 1971, via the base pair maximization algorithm by Nussinov and others in 1978, to the first efficient and complete solution to the free energy minimization problem by Zuker and Stiegler in 1981, and then on to a number of further refinements to date (Tinoco et al., 1971; Nussinov et al., 1978; Zuker and Stiegler, 1981; Wuchty et al., 1999; Lyngsoe et al., 1999). Second, there is a clear description of an open problem in a paper by Zuker and Sankoff in 1984, that to our knowledge has not been solved yet (Zuker and Sankoff, 1984). It is the problem of reducing the structure space of a given RNA to saturated secondary structures whose helices can not be extended any further by legal base pairs.

Level thesis:degree_level

thesis.doctoral

Grantor dc:publisher

Universität Bielefeld

Year

2003

Author dc:creator

• Evers, Dirk J.

Repository record source_url

https://pub.uni-bielefeld.de/record/2303583

OAI identifier oai:identifier

oai:pub.uni-bielefeld.de:2303583