A discipline of dynamic programming over sequence data

DOI10.1016/j.scico.2003.12.005zbMath1067.90157OpenAlexW1987010534WikidataQ56115924 ScholiaQ56115924MaRDI QIDQ1881254

Robert Giegerich, Carsten Meyer, Peter Steffen

Publication date: 4 October 2004

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2003.12.005

zbMATH Keywords

dynamic programmingstochastic systems

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (12)

Algebraic dynamic programming for multiple context-free grammars ⋮ Algebraic dynamic programming on trees ⋮ Forest alignment with affine gaps and anchors, applied in RNA structure comparison ⋮ Analyzing Ambiguity of Context-Free Grammars ⋮ Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems ⋮ Integrating Pareto optimization into dynamic programming ⋮ Partially local multi-way alignments ⋮ A short cut to optimal sequences ⋮ Analyzing ambiguity of context-free grammars ⋮ Unnamed Item ⋮ Table design in dynamic programming ⋮ Weighted parsing for grammar-based language models over multioperator monoids

This page was built for publication: A discipline of dynamic programming over sequence data