Algebraic dynamic programming for multiple context-free grammars
DOI10.1016/J.TCS.2016.05.032zbMATH Open1344.68112OpenAlexW2400986100WikidataQ56267171 ScholiaQ56267171MaRDI QIDQ301600FDOQ301600
Authors: Maik Riechert, Christian Höner zu Siederdissen, Peter F. Stadler 
Publication date: 30 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.032
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
dynamic programmingalgebraic dynamic programmingmultiple context-free grammarspseudoknotsRNA secondary structure prediction
Protein sequences, DNA sequences (92D20) Dynamic programming (90C39) Grammars and rewriting systems (68Q42)
Cites Work
- A note on two problems in connexion with graphs
- Introduction to algorithms
- Title not available (Why is that?)
- Analytic combinatorics
- Title not available (Why is that?)
- Differentiably finite power series
- On Context-Free Languages
- Title not available (Why is that?)
- Tree adjoining grammars for RNA structure prediction
- Tree adjunct grammars
- Multiset theory
- General context-free recognition in less than cubic time
- Fast context-free grammar parsing requires fast Boolean matrix multiplication
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Research in Computational Molecular Biology
- On multiple context-free grammars
- On parsing coupled-context-free languages
- Unbounded knapsack problem: Dynamic programming revisited
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems
- A discipline of dynamic programming over sequence data
- Combinatorics of RNA structures with pseudoknots
- Parsing beyond context-free grammars
- Title not available (Why is that?)
- On finding all suboptimal foldings of an RNA molecule
- Combinatorial Computational Biology of RNA
- Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
- An Improved Context-Free Recognizer
- Comprehending monads
- Title not available (Why is that?)
- Sneaking around concatmap, efficient combinators for dynamic programming
- Efficient divide-and-conquer parsing of practical context-free languages
- System FC with explicit kind equality
- A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
- Title not available (Why is that?)
- Semantics of context-free languages: Correction
- Some inherently ambiguous context-free languages
- Formal languages and compilation
- RNA folding and large \(N\) matrix theory
- Classifying RNA pseudoknotted structures
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Asymptotic enumeration of RNA structures with pseudoknots
Cited In (8)
- Title not available (Why is that?)
- Combinatorial Pattern Matching
- Algebraic dynamic programming
- An Algebraic Approach to Multiple Context-Free Grammars
- Statistics of topological RNA structures
- Sneaking around concatmap, efficient combinators for dynamic programming
- Title not available (Why is that?)
- Algebraic dynamic programming on trees
Uses Software
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)
