Ontology highlight
ABSTRACT:
SUBMITTER: Clote P
PROVIDER: S-EPMC4619022 | biostudies-literature | 2015
REPOSITORIES: biostudies-literature
PloS one 20151021 10
We describe the first dynamic programming algorithm that computes the expected degree for the network, or graph G = (V, E) of all secondary structures of a given RNA sequence a = a1, …, an. Here, the nodes V correspond to all secondary structures of a, while an edge exists between nodes s, t if the secondary structure t can be obtained from s by adding, removing or shifting a base pair. Since secondary structure kinetics programs implement the Gillespie algorithm, which simulates a random walk o ...[more]