Cargando…
Network Properties of the Ensemble of RNA Structures
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 = a (1), …, a (n). Here, the nodes V correspond to all secondary structures of a, while an edge exists between nodes s, t i...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2015
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4619022/ https://www.ncbi.nlm.nih.gov/pubmed/26488894 http://dx.doi.org/10.1371/journal.pone.0139476 |