Algebraic dynamic programming for multiple context-free grammars
From MaRDI portal
(Redirected from Publication:301600)
Recommendations
- Algebraic dynamic programming
- Algebraic dynamic programming on trees
- Rapid dynamic programming algorithms for RNA secondary structure
- Approximation and exact algorithms for RNA secondary structure prediction and recognition of stochastic context-free languages
- scientific article; zbMATH DE number 432797
Cites work
- scientific article; zbMATH DE number 5817498 (Why is no real title available?)
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3856167 (Why is no real title available?)
- scientific article; zbMATH DE number 1456969 (Why is no real title available?)
- scientific article; zbMATH DE number 3340123 (Why is no real title available?)
- scientific article; zbMATH DE number 3059214 (Why is no real title available?)
- A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
- A discipline of dynamic programming over sequence data
- A note on two problems in connexion with graphs
- An Improved Context-Free Recognizer
- Analytic combinatorics
- Asymptotic enumeration of RNA structures with pseudoknots
- Classifying RNA pseudoknotted structures
- Combinatorial Computational Biology of RNA
- Combinatorics of RNA structures with pseudoknots
- Comprehending monads
- Differentiably finite power series
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- Efficient divide-and-conquer parsing of practical context-free languages
- Fast context-free grammar parsing requires fast Boolean matrix multiplication
- Formal languages and compilation
- General context-free recognition in less than cubic time
- Introduction to algorithms
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
- Multiset theory
- On Context-Free Languages
- On finding all suboptimal foldings of an RNA molecule
- On multiple context-free grammars
- On parsing coupled-context-free languages
- Parsing beyond context-free grammars
- RNA folding and large \(N\) matrix theory
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Research in Computational Molecular Biology
- Semantics of context-free languages: Correction
- Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
- Sneaking around concatmap, efficient combinators for dynamic programming
- Some inherently ambiguous context-free languages
- System FC with explicit kind equality
- Tree adjoining grammars for RNA structure prediction
- Tree adjunct grammars
- Unbounded knapsack problem: Dynamic programming revisited
Cited in
(8)- An Algebraic Approach to Multiple Context-Free Grammars
- Statistics of topological RNA structures
- Algebraic dynamic programming on trees
- scientific article; zbMATH DE number 2090016 (Why is no real title available?)
- scientific article; zbMATH DE number 1615269 (Why is no real title available?)
- Sneaking around concatmap, efficient combinators for dynamic programming
- Combinatorial Pattern Matching
- Algebraic dynamic programming
This page was built for publication: Algebraic dynamic programming for multiple context-free grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301600)
