Algebraic dynamic programming for multiple context-free grammars
From MaRDI portal
Publication:301600
DOI10.1016/j.tcs.2016.05.032zbMath1344.68112OpenAlexW2400986100WikidataQ56267171 ScholiaQ56267171MaRDI QIDQ301600
Christian Höner zu Siederdissen, Maik Riechert, 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
dynamic programmingalgebraic dynamic programmingmultiple context-free grammarspseudoknotsRNA secondary structure prediction
Dynamic programming (90C39) Protein sequences, DNA sequences (92D20) Grammars and rewriting systems (68Q42)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Classifying RNA pseudoknotted structures
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Asymptotic enumeration of RNA structures with pseudoknots
- Multiset theory
- Differentiably finite power series
- On multiple context-free grammars
- General context-free recognition in less than cubic time
- Tree adjunct grammars
- Tree adjoining grammars for RNA structure prediction
- 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
- On Finding All Suboptimal Foldings of an RNA Molecule
- Fast context-free grammar parsing requires fast boolean matrix multiplication
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Combinatorial Computational Biology of RNA
- Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
- An Improved Context-Free Recognizer
- Comprehending monads
- Sneaking around concatMap
- Efficient divide-and-conquer parsing of practical context-free languages
- System FC with explicit kind equality
- On Context-Free Languages
- A Direct Proof of the Inherent Ambiguity of a Simple Context-Free Language
- Semantics of context-free languages: Correction
- Some inherently ambiguous context-free languages
- Research in Computational Molecular Biology
- Formal languages and compilation
- RNA folding and large \(N\) matrix theory
This page was built for publication: Algebraic dynamic programming for multiple context-free grammars
