A discipline of dynamic programming over sequence data
From MaRDI portal
Recommendations
Cited in
(23)- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
- Algebraic dynamic programming on trees
- Forest alignment with affine gaps and anchors, applied in RNA structure comparison
- scientific article; zbMATH DE number 2090016 (Why is no real title available?)
- Dynamic programming via thinning and incrementalization
- Partially local multi-way alignments
- Weighted parsing for grammar-based language models over multioperator monoids
- A short cut to optimal sequences
- Integrating Pareto optimization into dynamic programming
- Table design in dynamic programming
- Analyzing Ambiguity of Context-Free Grammars
- scientific article; zbMATH DE number 1615269 (Why is no real title available?)
- Algebraic dynamic programming for multiple context-free grammars
- On the reconstruction of optimal solutions in methods of dynamic programming for the sequence analysis
- Unifying dynamic programming design patterns
- scientific article; zbMATH DE number 7559176 (Why is no real title available?)
- Dynamic Programming Algorithms as Products of Weighted Logic Programs
- Analyzing ambiguity of context-free grammars
- Calculating PSSM probabilities with lazy dynamic programming
- Sneaking around concatmap, efficient combinators for dynamic programming
- Algebraic dynamic programming
- Recursion Schemes for Dynamic Programming
- Cache efficient simple dynamic programming
This page was built for publication: A discipline of dynamic programming over sequence data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881254)
