Cargando…
Algebraic Dynamic Programming over general data structures
BACKGROUND: Dynamic programming algorithms provide exact solutions to many problems in computational biology, such as sequence alignment, RNA folding, hidden Markov models (HMMs), and scoring of phylogenetic trees. Structurally analogous algorithms compute optimal solutions, evaluate score distribut...
Autores principales: | zu Siederdissen, Christian Höner, Prohaska, Sonja J, Stadler, Peter F |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4686793/ https://www.ncbi.nlm.nih.gov/pubmed/26695390 http://dx.doi.org/10.1186/1471-2105-16-S19-S2 |
Ejemplares similares
-
Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
por: Prohaska, Sonja J., et al.
Publicado: (2017) -
Selection Pressures on RNA Sequences and Structures
por: Nowick, Katja, et al.
Publicado: (2019) -
A folding algorithm for extended RNA secondary structures
por: zu Siederdissen, Christian Höner, et al.
Publicado: (2011) -
flowEMMi: an automated model-based clustering tool for microbial cytometric data
por: Ludwig, Joachim, et al.
Publicado: (2019) -
Coordinate systems for supergenomes
por: Gärtner, Fabian, et al.
Publicado: (2018)