Bellman's GAP - A language and compiler for dynamic programming in sequence analysis

Bioinformatics

Volumn 29, Issue 5, 2013, Pages 551-560

  Sauthoff, Georg ^a   Möhl, Mathias ^b,c   Janssen, Stefan ^a   Giegerich, Robert ^a  

^a BIELEFELD UNIVERSITY   (Germany)

^b Department of Computer Science ^*  (Germany)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGY; COMPUTER LANGUAGE; METHODOLOGY; RNA FOLDING; SEQUENCE ANALYSIS;

ALGORITHMS; COMPUTATIONAL BIOLOGY; PROGRAMMING LANGUAGES; RNA FOLDING; SEQUENCE ANALYSIS;

EID: 84874719339     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btt022     Document Type: Article

References (20)

1. Abouelhoda, M. I. et al. (2009) Alignment of minisatellite maps based on run-length encoding scheme. J. Bioinform. Comput. Biol., 7, 287-308.
2. Durbin, R. et al. (1998) Biological Sequence Analysis. Cambridge University Press, Cambridge, M A.
3. Fabregat-Traver, D. and Bientinesi, P. (2012) A domain-specific compiler for linear algebra operations. In: High Performance Computing for Computational Science - VECPAR 2012, Lecture Notes in Computer Science. Springer, Berlin/Heidelberg.
4. Giegerich, R. and Steffen, P. (2006) Challenges in the compilation of a domain specific language for dynamic programming. In: Haddad, H. (ed.) Proceedings of the 2006 ACM Symposium on Applied Computing. ACM, New York.
5. Giegerich, R. et al. (2004) A discipline of dynamic programming over sequence data. Sci. Comput. Program., 51, 215-263.
6. Huang, J. et al. (2012) Abstract folding space analysis based on helices. RNA, 18, 2135-2147.
7. Janssen, S. et al. (2011) Lost in folding space? Comparing four variants of the thermodynamic model for RNA secondary structure prediction. BMC Bioinformatics, 12, 429.
8. Lorenz, R. et al. (2011) ViennaRNA package 2.0. Algorithms for Mol. Biol., 6, 26.
9. Lowes, B. (2012) Analysis of minisatellite sequences with Algebraic Dynamic Programming in Bellman's GAP. Master's thesis, Bielefeld University, Bielefeld, Germany.
10. Needleman, S. B. and Wunsch, C. D. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48, 443-453.
11. Nussinov, R. et al. (1978) Algorithms for loop matchings. SIAM J. Appl. Math., 35, 68-82.
12. Quince, C. et al. (2011) Removing noise from pyrosequenced amplicons. BMC Bioinformatics, 12, 38.
13. Reeder, J. and Knight, R. (2010) Rapidly denoising pyrosequencing amplicon reads by exploiting rank-abundance distributions. Nat. Methods, 7, 668-669.
14. Reeder, J. et al. (2007) Locomotif: from graphical motif description to RNA motif search. Bioinformatics, 23, i392.
15. Reinkensmeier, J. et al. (2011) Conservation and occurrence of trans-encoded srnas in the rhizobiales. Genes, 2, 925-956.
16. Rivas, E. et al. (2012) A range of complex probabilistic models for RNA secondary structure prediction that includes the nearest-neighbor model and more. RNA, 18, 193-212.
17. Sauthoff, H. (2011) Bellman's GAP: A 2nd Generation Language and System for Algebraic Dynamic Programming. PhD Thesis, Bielefeld University, Bielefeld, Germany.
18. Sauthoff, H. et al. (2011) Bellman's GAP: a declarative language for dynamic programming. In: Proceedings of the 13th International ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming, PPDP '11, ACM, pp.29-40, New York, NY, US A.
19. Steffen, P. et al. (2006) RNAshapes: an integrated RNA analysis package based on abstract shapes. Bioinformatics, 22, 500-503. (Pubitemid 43231429)
20. Theis, C. et al. (2010) Prediction of RNA secondary structure including kissing hairpin motifs. In: Proceedings of the 10th Workshop on Algorithms in Bioinformatics (WABI 2010) LNBI 6293. Springer, Heidelberg, pp. 52-64.