Cargando…
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...
Autores principales: | Venkatachalam, Balaji, Gusfield, Dan, Frid, Yelena |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
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 |
Ejemplares similares
-
An improved Four-Russians method and sparsified Four-Russians algorithm for RNA folding
por: Frid, Yelena, et al.
Publicado: (2016) -
A simple, practical and complete O[Image: see text]-time Algorithm for RNA folding using the Four-Russians Speedup
por: Frid, Yelena, et al.
Publicado: (2010) -
Algorithms on strings, trees, and sequences : computer science and computational biology
por: Gusfield, Dan
Publicado: (1997) -
Infernal 1.1: 100-fold faster RNA homology searches
por: Nawrocki, Eric P., et al.
Publicado: (2013) -
Multicore and GPU algorithms for Nussinov RNA folding
por: Li, Junjie, et al.
Publicado: (2014)