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