Algebraic dynamic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2422, Issue , 2002, Pages 349-364

  Giegerich, Robert ^a   Meyer, Carsten ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; OPERATIONS RESEARCH; PROGRAM DEBUGGING; SPECIFICATION LANGUAGES; STOCHASTIC SYSTEMS; SYSTEMS ANALYSIS;

ALGEBRAIC DYNAMIC PROGRAMMING; ALGORITHM DESIGN; DISCRETE STRUCTURE; DYNAMIC PROGRAMMING ALGORITHM; EXECUTABLE SPECIFICATION LANGUAGES; FORMAL FRAMEWORK; LEVEL OF ABSTRACTION; PROGRAMMING TECHNIQUE;

DYNAMIC PROGRAMMING;

EID: 84944069963     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45719-4_24     Document Type: Conference Paper

References (27)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, USA, 1983. 350
2. R. Bellman. Dynamic Programming. Princeton University Press, 1957. 349, 353, 354, 356
3. R. S. Bird and O. de Moor. From dynamic programming to greedy algorithms. In B. Moeller, editor, State-of-the-Art Seminar on Formal Program Development. Springer LNCS 755, 1993. 349
4. W. S. Brainerd. Tree generating regular systems. Information and Control, 14: 217–231, 1969. 353
5. G. Brassard and P. Bratley. Algorithmics: Theory and Practice. Prentice-Hall, 1988. 350
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990. 350
7. S. Curtis. Dynamic programming: A different perspective. In R. Bird and L. Meertens, editors, Algorithmic Languages and Calculi, pages 1–23. Chapman & Hall, London, U. K., 1997. 349, 362
8. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis. Cambridge University Press, 1998. 350, 354, 357
9. D. Evers and R. Giegerich. Reducing the conformation space in RNA structure prediction. In German Conference on Bioinformatics, 2001. 350
10. R. Giegerich. A Systematic Approach to Dynamic Programming in Bioinformatics. Bioinformatics, 16: 665–677, 2000. 350, 352, 353
11. R. Giegerich. Explaining and controlling ambiguity in dynamic programming. In Proc. Combinatorial Pattern Matching, pages 46–59. Springer Verlag, 2000. 350
12. R. Giegerich, M. Höchsmann, and S. Kurtz. Local Similarity Problems on Trees: A Uniform Model and its Implementation. 2002. (submitted). 363
13. R. Giegerich and K. Schmal. Code selection techniques: Pattern matching, tree parsing and inversion of derivors. In Proc. European Symposium on Programming 1988, pages 247–268. Springer LNCS 300, 1988. 353
14. R. Giegerich and P. Steffen. Implementing algebraic dynamic programming in the functional and the imperative paradigm. In E. A. Boiten and B. Möller, editors, Mathematics of Program Construction, pages 1–20. Springer LNCS 2386, 2002. 350, 354, 356, 357, 359
15. O. Gotoh. An improved algorithm for matching biological sequences. J. Mol. Biol., 162: 705–708, 1982. 361
16. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997. 350, 351
17. S. Kurtz. Fundamental Algorithms for a Declarative Pattern Matching System. Dissertation, Technische Fakultät der Universität Bielefeld, 1995. 362
18. K. Mehlhorn. Data structures and algorithms. Springer Verlag, 1984. 350
19. C. Meyer and R. Giegerich. Matching and Significance Evaluation of Combined Sequence-Structure Motifs in RNA. Z.Phys.Chem., 216: 193–216, 2002. 359
20. L. Mitten. Composition principles for the synthesis of optimal multi-stage processes. Operations Research, 12: 610–619, 1964. 349
21. O. de Moor. Dynamic Programming as a Software Component. In M. Mastorakis, editor, Proceedings of CSCC, July 4-8, Athens. WSES Press, 1999. 349
22. T. L. Morin. Monotonicity and the principle of optimality. Journal of Mathematical Analysis and Applications, 86: 665–674, 1982. 349, 353, 354, 357
23. S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol., 48: 443–453, 1970. 360
24. R. Sedgewick. Algorithms. Addison-Wesley, 2nd edition, 1989. 350
25. T. F. Smith and M. S. Waterman. The identification of common molecular subsequences. J. Mol. Biol., 147: 195–197, 1981. 360
26. M. Zuker and S. Sankoff. RNA secondary structures and their prediction. Bull. Math. Biol., 46: 591–621, 1984. 350
27. M. Zuker and P. Stiegler. Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Res., 9(1): 133–148, 1981. 352