title: Product Grammars for Alignment and Folding.
abstract: We develop a theory of algebraic operations over linear and context-free grammars that makes it possible to combine simple "atomic" grammars operating on single sequences into complex, multi-dimensional grammars. We demonstrate the utility of this framework by constructing the search spaces of complex alignment problems on multiple input sequences explicitly as algebraic expressions of very simple one-dimensional grammars. In particular, we provide a fully worked frameshift-aware, semiglobal DNA-protein alignment algorithm whose grammar is composed of products of small, atomic grammars. The compiler accompanying our theory makes it easy to experiment with the combination of multiple grammars and different operations. Composite grammars can be written out in L(A)T(E)X for documentation and as a guide to implementation of dynamic programming algorithms. An embedding in Haskell as a domain-specific language makes the theory directly accessible to writing and using grammar products without the detour of an external compiler. Software and supplemental files available here: http://www.bioinf. uni-leipzig.de/Software/gramprod/.
authors.forename: Christian
authors.initials: C
authors.lastname: Höner Zu Siederdissen
authors.forename: Ivo L
authors.initials: IL
authors.lastname: Hofacker
authors.forename: Peter F
authors.initials: PF
authors.lastname: Stadler
mesh_terms: D000465:Algorithms; D000595:Amino Acid Sequence; D001483:Base Sequence; D019295:Computational Biology / Q000379:methods*; D006801:Humans; D017510:Protein Folding; D012660:Semantics; D016415:Sequence Alignment / Q000379:methods*