A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure

BACKGROUND: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algorithm for aligning a CM to an RNA sequence of length N is O(N(3)) in memory. This is only practical for small RNAs. RESUL...

Descripción completa

Detalles Bibliográficos
Autor principal: Eddy, Sean R
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2002
Materias:
Research article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC119854/
https://www.ncbi.nlm.nih.gov/pubmed/12095421
http://dx.doi.org/10.1186/1471-2105-3-18

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC119854/
https://www.ncbi.nlm.nih.gov/pubmed/12095421
http://dx.doi.org/10.1186/1471-2105-3-18

Ejemplares similares