Loading...
Computing folding pathways between RNA secondary structures
Given an RNA sequence and two designated secondary structures A, B, we describe a new algorithm that computes a nearly optimal folding pathway from A to B. The algorithm, RNAtabupath, employs a tabu semi-greedy heuristic, known to be an effective search strategy in combinatorial optimization. Foldin...
Na minha lista:
| Main Authors: | , , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Oxford University Press
2010
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2836545/ https://ncbi.nlm.nih.gov/pubmed/20044352 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1093/nar/gkp1054 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|