An algebra of liner 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 (LaTeX, ANSI, Haskell module with signature and grammar).

Formal background can be found in two papers:

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.
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6819790

and

Christian Höner zu Siederdissen, Ivo L. Hofacker, and Peter F. Stadler
How to Multiply Dynamic Programming Algorithms
Brazilian Symposium on Bioinformatics (BSB 2013)
Lecture Notes in Bioinformatics 8213, Springer, Heidelberg

---

[Skip to Readme]

Modules

[Index]

Flags

Manual Flags

Name	Description	Default
examples	build the examples (only Needleman-Wunsch for now)	Disabled
llvm	build using LLVM	Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

• GrammarProducts-0.1.0.0.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• ChristianHoener

For package maintainers and hackage trustees

• edit package information

Candidates

• No Candidates