Grammar products and higher-dimensional grammars.
generalized Algebraic Dynamic Programming
An algebra of linear and context-free grammars.
This library provides the implementation of our theory of algebraic operations over linear and context-free grammars. Using algebraic operations, it is possible to construct complex dynamic programming algorithms from simpler "atomic" grammars.
Our most important contribution is the definition of a product of grammars which naturally leads to alignment-like algorithms on multiple tapes.
An efficient implementation of the resulting grammars is possible via the ADPfusion framework. The FormalGrammars library provides the required "Template Haskell" machinery. GramarProducts can be integrated as a plugin into the existing transformation from DSL to ADPfusion. Haskell users can just use the QQ function provided in the .QQ module.
Alternatively, the resulting grammars can also be pretty-printed in various ways (ANSI, Haskell module with signature and grammar).
The formal background can be found in two papers given in the README. The gADP homepage has further details, tutorials, examples.
GrammarProducts: Products of formal languages
generalized Algebraic Dynamic Programming Homepage
An abstract algebra for linear and context-free grammars.
- Christian Höner zu Siederdissen, Ivo L. Hofacker, and Peter F. Stadler.
Product Grammars for Alignment and Folding
2014, IEEE/ACM Transactions on Computational Biology and Bioinformatics. 99
paper - Christian Höner zu Siederdissen, Ivo L. Hofacker, and Peter F. Stadler.
How to Multiply Dynamic Programming Algorithms
2013, Brazilian Symposium on Bioinformatics (BSB 2013)
Lecture Notes in Bioinformatics 8213. Springer, Heidelberg.
paperpreprint
Contact
Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany
[email protected]
http://www.bioinf.uni-leipzig.de/~choener/