The GrammarProducts package

[Tags: gpl, library]

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 machinary.

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 submitted


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


Change logchangelog
DependenciesADPfusion (>=0.2.0), ansi-wl-pprint, base (==4.*), bytestring, cmdargs (==0.10.*), containers, data-default, FormalGrammars (>=, HaTeX, lens, newtype, parsers, PrimitiveArray (>=, semigroups, transformers, trifecta [details]
CopyrightChristian Hoener zu Siederdissen, Ivo L. Hofacker, Peter F. Stadler, 2013
AuthorChristian Hoener zu Siederdissen, 2013
CategoryFormal Languages, Bioinformatics
Home page
Source repositoryhead: git clone git://
UploadedWed Dec 18 00:19:49 UTC 2013 by ChristianHoener
Downloads898 total (18 in last 30 days)
0 []
StatusDocs not available [build log]
Successful builds reported [all 6 reports]



Maintainers' corner

For package maintainers and hackage trustees