Faster algorithms for RNA-folding using the Four-Russians method

BACKGROUND: The secondary structure that maximizes the number of non-crossing matchings between complimentary bases of an RNA sequence of length n can be computed in O(n(3)) time using Nussinov’s dynamic programming algorithm. The Four-Russians method is a technique that reduces the running time for...

Descripción completa

Detalles Bibliográficos
Autores principales: Venkatachalam, Balaji, Gusfield, Dan, Frid, Yelena
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2014
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3996002/
https://www.ncbi.nlm.nih.gov/pubmed/24602450
http://dx.doi.org/10.1186/1748-7188-9-5

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3996002/
https://www.ncbi.nlm.nih.gov/pubmed/24602450
http://dx.doi.org/10.1186/1748-7188-9-5

Ejemplares similares