Carregant...
A Dynamic Programming Algorithm for Finding the Optimal Segmentation of an RNA Sequence in Secondary Structure Predictions
In this paper, we present a dynamic programming algorithm that runs in polynomial time and allows us to achieve the optimal, non-overlapping segmentation of a long RNA sequence into segments (chunks). The secondary structure of each chunk is predicted independently, then combined with the structures...
Guardat en:
| Publicat a: | 2nd Int Conf Bioinform Comput Biol (2010) |
|---|---|
| Autors principals: | , , , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2010
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4335647/ https://ncbi.nlm.nih.gov/pubmed/25705724 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|