TY - JOUR AU - zu Siederdissen, Christian Höner AU - Prohaska, Sonja J. AU - Stadler, Peter F. PY - 2015 DA - 2015/12/16 TI - Algebraic Dynamic Programming over general data structures JO - BMC Bioinformatics SP - S2 VL - 16 IS - 19 AB - 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 distributions, and perform stochastic sampling. This is explained in the theory of Algebraic Dynamic Programming (ADP) by a strict separation of state space traversal (usually represented by a context free grammar), scoring (encoded as an algebra), and choice rule. A key ingredient in this theory is the use of yield parsers that operate on the ordered input data structure, usually strings or ordered trees. The computation of ensemble properties, such as a posteriori probabilities of HMMs or partition functions in RNA folding, requires the combination of two distinct, but intimately related algorithms, known as the inside and the outside recursion. Only the inside recursions are covered by the classical ADP theory. SN - 1471-2105 UR - https://doi.org/10.1186/1471-2105-16-S19-S2 DO - 10.1186/1471-2105-16-S19-S2 ID - zu Siederdissen2015 ER -