Table design in dynamic programming

Information and Computation

Volumn 204, Issue 9, 2006, Pages 1325-1345

  Steffen, Peter ^a   Giegerich, Robert ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Dynamic programming; NP completeness; Programming methodology; Space time trade off

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; ECONOMIC AND SOCIAL EFFECTS; OPTIMIZATION;

ASYMPTOTIC EFFICIENCY; BRUTE FORCE ALGORITHMS; COMBINATORIAL OPTIMIZATION PROBLEMS; DYNAMIC PROGRAMMING ALGORITHM; NP-COMPLETENESS; PROGRAMMING METHODOLOGY; RECURSIVE DECOMPOSITION; SPACE-TIME TRADE-OFFS;

DYNAMIC PROGRAMMING;

EID: 84855201437     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.02.006     Document Type: Article

References (27)

1. A. Aho, J. Ullman, The Theory of Parsing, Translation and Compiling, Prentice-Hall, Englewood Cliffs, NJ, 1973.
2. A. Aho, J. Hopcroft, J. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, MA, 1982.
3. V. Bafna, N. Edwards, On de novo interpretation of tandem mass spectra for peptide identification, in: Proceedings of the Seventh Annual International Conference on Computational Molecular Biology, ACM Press, New York, 2003, pp. 9-18.
4. R. Bellman, Dynamic Programming, Princeton University Press, Princeton, NJ, 1957.
5. R. Bellman, S. Dreyfus, Applied Dynamic Programming, Princeton University Press, Princeton, NJ, 1962.
6. H. Bodlaender, J. Telle, Space-efficient construction variants of dynamic programming, Nordic J. Comput. 11(4) (2004) 374-385.
7. W. Brainerd, Tree generating regular systems, Inform. Control 14(1969) 217-231.
8. G. Brassard, P. Bratley, Algorithmics: Theory and Practice, Prentice-Hall, Englewood Cliffs, NJ, 1988.
9. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
10. E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1(1959) 269-271.
11. R. Durbin, S. Eddy, A. Krogh, G. Mitchison, Biological Sequence Analysis, Cambridge University Press, Cambridge, MA, 1998.
12. R. Giegerich, A systematic approach to dynamic programming in bioinformatics, Bioinformatics 16(2000) 665-677.
13. R. Giegerich, C. Meyer, P. Steffen, A discipline of dynamic programming over sequence data, Sci. Comput. Program. 51(3) (2004) 215-263.
14. D. Gusfield, Algorithmson Strings, Trees, and Sequences, Computer Science and Computational Biology, Cambridge University Press, Cambridge, MA, 1997.
15. D. Hirschberg, A linear space algorithm for computing maximal common subsequences, Commun. ACM 18(6) (1975) 341-343.
16. R. M. Karp, R. E. Miller, S. Winograd, The organization of computations for uniform recurrence equations, J. ACM 14(3) (1967) 563-590.
17. D. E. Knuth, A generalization of Dijkstra's algorithm, Inform. Process. Lett. 6(1) (1977) 1-5.
18. J. M. Lewis, M. Yannakakis, The node-deletion problem for hereditary properties is NP-complete, J. Comput. System Sci. 20(2) (1980) 219-230. (Pubitemid 11421552)
19. Y. Liu, S. Stoller, Program optimization using indexed and recursive data structures, in: PEPM'02: Proceedings of the 2002 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, New York, NY, 2002, pp. 108-118. (Pubitemid 35009474)
20. K. Mehlhorn, Data Structures and Algorithms, Springer-Verlag, New York, 1984.
21. E. Myers, W. Miller, Optimal alignment in linear space, Comput. Appl. Biosci. 4(1) (1988) 11-17.
22. in: L. Pachter, B. Sturmfels (Eds.), Algebraic Statistics for Computational Biology, Cambridge University Press, Cambridge, MA, 2005.
23. J. Reeder, R. Giegerich, Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics, BMC Bioinformatics, 5(104) (2004), in press.
24. G. Rote, Path problems ingraphs, in: in: G. Tinhofer, E. Mayr, H. Noltemeier, M. Syslo (Eds.), Computational Graph Theory, Computing Supplementum, vol. 7, Springer-Verlag, New York, 1990, pp. 155-189.
25. A. Sczyrba, J. Krüger, H. Mersch, S. Kurtz, R. Giegerich, RNA-related tools on the bielefeld bioinformatics server, Nuclic Acids Res. 31(13) (2003) 3767-3770. (Pubitemid 37442242)
26. R. Sedgewick, Algorithms, Second ed., Addison-Wesley, Reading, MA, 1989.
27. R. E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1(2) (1972) 146-160.