Structural constraints and neutrality in RNA

Ulrike Göbel, Christian V. Forst, Peter Schuster

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations


Generic properties of neutral networks of RNA secondary structures can be described by means of random graph theory. The success of this approach is dependent on details of the underlying secondary structure. Some of these dependencies are analyzed in this paper. In addition we present an algorithm, which, given a network does conform to the random graph model, allows to determine whether it is a connected graph. The algorithm is linear in time in the sequence length, this being possible because of local connectivity, a special property of graphs under the random graph model.

Original languageEnglish
Title of host publicationBioinformatics - German Conference on Bioinformatics, GCB 1996, Selected Papers
EditorsThomas Lengauer, Ralf Hofestädt, Dietmar Schomburg, Markus Löffier
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540633707, 9783540633709
StatePublished - 1997
Externally publishedYes
EventInternational German Conference on Bioinformatics, GCB 1996 - Leipzig, Germany
Duration: 30 Sep 19962 Oct 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational German Conference on Bioinformatics, GCB 1996


Dive into the research topics of 'Structural constraints and neutrality in RNA'. Together they form a unique fingerprint.

Cite this