Books

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press. (Chapter 15: Dynamic Programming)
2. Gusfield, D. (1997). Algorithms on Strings, Trees, and Sequences. Cambridge University Press.
3. Kleinberg, J., & Tardos, É. (2005). Algorithm Design. Pearson. (Chapter 6: Dynamic Programming)

Research Papers

1. Needleman, S. B., & Wunsch, C. D. (1970). A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48(3), 443-453.
2. Wagner, R. A., & Fischer, M. J. (1974). The string-to-string correction problem. Journal of the ACM, 21(1), 168-173.

Online Video Lectures

1. NPTEL: Design and Analysis of Algorithms

   • Offered by: IIT Bombay
   • Instructors: Abhiram G. Ranade, Ajit A. Diwan, Sundar Viswanathan
   • Link: https://nptel.ac.in/courses/106101060

2. NPTEL (NOC): Design and Analysis of Algorithms

   • Offered by: Chennai Mathematical Institute
   • Instructor: Madhavan Mukund
   • Link: https://nptel.ac.in/courses/106106131