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...

Descripción completa

Detalles Bibliográficos
Autores principales: Dotu, Ivan, Lorenz, William A., Van Hentenryck, Pascal, Clote, Peter
Formato: Texto
Lenguaje:English
Publicado: Oxford University Press 2010
Materias:
RNA
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2836545/
https://www.ncbi.nlm.nih.gov/pubmed/20044352
http://dx.doi.org/10.1093/nar/gkp1054

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2836545/
https://www.ncbi.nlm.nih.gov/pubmed/20044352
http://dx.doi.org/10.1093/nar/gkp1054

Ejemplares similares