The Community for Technology Leaders
RSS Icon
Subscribe
pp: 1
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 1-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 LATEX 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. http://www.bioinf.uni-leipzig.de/Software/gramprod/
INDEX TERMS
Grammar, Production, Bioinformatics, Heuristic algorithms, Dynamic programming, Computational biology, IEEE transactions,Haskell, linear grammar, context free grammar, product structure, multiple alignment
CITATION
Peter Stadler, "Product Grammars for Alignment and Folding", IEEE/ACM Transactions on Computational Biology and Bioinformatics, , no. 1, pp. 1, PrePrints PrePrints, doi:10.1109/TCBB.2014.2326155
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool