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/" /> 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/" /> 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/" /> Product Grammars for Alignment and Folding
The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - May-June (2015 vol.12)
pp: 507-519
Christian Honer zu Siederdissen , Dept. of Theor. Chem., Univ. of Vienna, Vienna, Austria
Ivo L. Hofacker , Dept. of Theor. Chem., Univ. of Vienna, Vienna, Austria
Peter F. Stadler , Dept. of Comput. Sci., Bioinf. Group, Univ. of Leipzig, Leipzig, Germany
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 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. Software and supplemental files available here: http://www.bioinf. uni-leipzig.de/Software/gramprod/.
INDEX TERMS
proteins, bioinformatics, context-free grammars, DNA, molecular biophysics, programming languages,product grammars, domain-specific language, dynamic programming algorithms, LATEX, frameshift-aware semiglobal DNA-protein alignment algorithm, multiple input sequences, complex multidimensional grammars, simple atomic grammars, context-free grammars, linear grammars, algebraic operations, folding, complex alignment problems,Bioinformatics, Heuristic algorithms, Dynamic programming, Computational biology,Haskell, linear grammar, context free grammar, product structure, multiple alignment,Haskell, linear grammar, context free grammar, product structure, multiple alignment
CITATION
Christian Honer zu Siederdissen, Ivo L. Hofacker, Peter F. Stadler, "Product Grammars for Alignment and Folding", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.12, no. 3, pp. 507-519, May-June 2015, doi:10.1109/TCBB.2014.2326155
137 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool