Explaining and controlling ambiguity in dynamic programming

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

Volumn 1848, Issue , 2000, Pages 46-59

  Giegerich, Robert ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

ALGEBRAIC APPROACHES; DYNAMIC PROGRAMMING ALGORITHM; INDEPENDENT SOURCES; NONUNIQUENESS; OPTIMAL SOLUTIONS; RECURSION SCHEMES; SEARCH SPACES; SEQUENCE COMPARISONS;

DYNAMIC PROGRAMMING;

EID: 84937404651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45123-4_6     Document Type: Conference Paper

References (25)

1. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
2. W.S. Brainerd. Tree generating regular systems. Information and Control, 14:217-231, 1969.
3. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
4. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison. Biological Sequence Analysis. Cambridge University Press, 1998.
5. D. Evers. RNA Folding via Algebraic Dynamic Programming. Bielefeld University, 2000. Forthcoming Dissertation.
6. D. Evers and R. Giegerich. RNA Movies: Visualizing RNA Secondary Structure Spaces. Bioinformatics, 15(1):32-37, 1999.
7. R. Giegerich. Code Selection by Inversion of Order-Sorted Derivors. Theor. Comput. Sci., 73:177-211, 1990.
8. R. Giegerich. A declarative approach to the development of dynamic programming algorithms, applied to RNA folding. Report 98-02, Technische Fakult¨at, Universit¨at Bielefeld, 1998.
9. R. Giegerich. Towards a discipline of dynamic programming in bioinformatics. Parts 1 and 2: Sequence comparison and RNA folding. Report 99-05, Technische Fakultät, Universität Bielefeld, 1999. (Lecture Notes).
10. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
11. D. Gusfield, K. Balasubramanian, and D. Naor. Parametric Optimization of Sequence Alignment. Algorithmica, 12:312-326, 1994.
12. I.L. Hofacker, P. Schuster, and P.F. Stadler. Combinatorics of rna secondary structures. Discr. Appl. Math, 89:177-207, 1999.
13. G. Hutton. Higher Order Functions for Parsing. Journal of Functional Programming, 3(2):323-343, 1992.
14. S. Kurtz and G. W. Myers. Estimating the Probability of Approximate Matches. In Proceedings Combinatorial Pattern Matching, pages 52-64, 1997.
15. H.T. Mevissen and M. Vingron. Quantifying the Local Reliability of a Sequence Alignment. Prot. Eng., 9(2), 1996.
16. C. Meyer. Lazy Auswertung von Rekurrenzen der Dynamischen Programmierung, 1999. Diploma Thesis, Bielefeld University, (in German).
17. D. Naor and D. Brutlag. On Near-Optimal Alignments in Biological Sequences. J. Comp. Biol., 1:349-366, 1994.
18. 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.
19. R. Nussinov, G. Pieczenik, J.R. Griggs, and D.J. Kleitman. Algorithms for loop matchings. SIAM J. Appl. Math., 35:68-82, 1978.
20. M. S. Waterman and T. F. Smith. RNA secondary structure: A complete mathematical analysis. Math. Biosci., 41:257-266, 1978.
21. M.S. Waterman and T.H. Byers. A dynamic programming algorithm to find all solutions in a neighborhood of the optimum. Math. Biosci., 77:179-188, 1985.
22. S. Wuchty, I. Fontana, W Hofacker, and P. Schuster. Complete suboptimal folding of RNA and the stability of secondary structures. Biopolymers, 49:145-165, 1998.
23. M. Zuker. On Finding all Suboptimal Foldings of an RNA Molecule. Science, 244:48-52, 1989.
24. M. Zuker and S. Sankoff. RNA secondary structures and their prediction. Bull. Math. Biol., 46:591-621, 1984.
25. 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.