Ingrid G. Abfalter

Learn More
Understanding the relationship between protein sequence and structure is one of the great challenges in biology. In the case of the ubiquitous coiled-coil motif, structure and occurrence have been described in extensive detail, but there is a lack of insight into the rules that govern oligomerization, i.e. how many α-helices form a given coiled coil. To(More)
RNA molecules that can fold into two or more predefined alternative metastable structures can be designed rationally. We outline an algorithm for this task that reduces the problem to vertex coloring the union of all prescribed outerplanar secondary structure graphs. Starting from an ear decomposition of this composite graph colorings are produced by a(More)
RNA has become an integral building material in synthetic biology. Dominated by their secondary structures, which can be computed efficiently, RNA molecules are amenable not only to in vitro and in vivo selection, but also to rational, computation-based design. While the inverse folding problem of constructing an RNA sequence with a prescribed ground-state(More)
Within the last years it became clear that RNA molecules do not only store<lb>and transfer genetic information but they can also act as catalytic units.<lb>On the one hand, RNA was seen once as an ’information-exchanging-unit’<lb>between DNA and proteins. On the other hand nowadays it has become<lb>evident that RNA fulfills important regulation tasks in(More)
The aim of the work described in this thesis was the creation of a software tool to support the rational design of RNA molecules capable of forming two or more alternative metastable structures. This required the creation of a logical information model, thus isolating relevant aspects of the biological problem as posed, and incorporating these into a(More)
Alignment algorithms normally generate only a single optimal alignment. No information about possible alternative alignments or the reliability of the result is provided. We address this problem by calculating match probabilities and by generating a fairly distributed ensemble of optimal and suboptimal alignments. The partition function of all possible(More)