Expected degree for RNA secondary structure networks.
Consider the network of all secondary structures of a given RNA sequence, where nodes are connected when the corresponding structures have base pair distance one. The expected degree of the network is the average number of neighbors, where average may be computed with respect to the either the uniform or Boltzmann probability. Here, we describe the first algorithm, RNAexpNumNbors, that can compute the expected number of neighbors, or expected network degree, of an input sequence. For RNA sequences from the Rfam database, the expected degree is significantly less than the constrained minimum free energy structure, defined to have minimum free energy (MFE) over all structures consistent with the Rfam consensus structure. The expected degree of structural RNAs, such as purine riboswitches, paradoxically appears to be smaller than that of random RNA, yet the difference between the degree of the MFE structure and the expected degree is larger than that of random RNA. Expected degree does not seem to correlate with standard structural diversity measures of RNA, such as positional entropy and ensemble defect. The program RNAexpNumNbors is written in C, runs in cubic time and quadratic space, and is publicly available at http://bioinformatics.bc.edu/clotelab/RNAexpNumNbors.
Biology Department, Boston College, Higgins 355, 140 Commonwealth Avenue, Chestnut Hill, Massachusetts, 02467.
Peter
P
Clote
D000465:Algorithms; D001483:Base Sequence; D016208:Databases, Factual; D009690:Nucleic Acid Conformation; D012313:RNA / Q000737:chemistry*; D012984:Software; D013816:Thermodynamics
D012313:RNA
RNA secondary structure; macromolecular network; network degree; small-world