A carregar...
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...
Na minha lista:
| Main Authors: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
BioMed Central
2014
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3996002/ https://ncbi.nlm.nih.gov/pubmed/24602450 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1748-7188-9-5 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|