@article{bellman1954theory,
  title={The theory of dynamic programming},
  author={Bellman, Richard},
  journal={Bulletin of the American Mathematical Society},
  volume={60},
  number={6},
  pages={503--515},
  year={1954}
}

@misc{conversableeconomist,
    title   = {Cnoversable Economist},
    author  = {Timothy Taylor},
    year    = {2022},
    url     = {https://conversableeconomist.com/2022/08/24/why-is-it-called-dynamic-programming/},
    note    = {Accessed: April 12 , 2024}
}

@book{algosbook2,
    author    = {Cormen, Leiseron, Rivest and Stein},
    title     = {Introduction to Algorithms, 3rd ed.},
    publisher = {MIT},
    year      = {2014},
    isbn      = {9780262033848}
}

@article{bellman1966dynamic,
  title={Dynamic programming},
  author={Bellman, Richard},
  journal={science},
  volume={153},
  number={3731},
  pages={34--37},
  year={1966},
  publisher={American Association for the Advancement of Science}
}

@misc{leetcode,
    title   = {LeetCode},
    author  = {LeetCode},
    year    = {2024},
    url     = {https://www.leetcode.com},
    note    = {Accessed: April 12 , 2024}
}

@misc{enjoyalgorithms,
    title   = {Enjoyalgorithms},
    author  = {Enjoyalgorithms},
    year    = {2024},
    url     = {https://www.enjoyalgorithms.com},
    note    = {Accessed: April 12 , 2024}
}

@misc{geeksforgeeks,
    title   = {GeeksForGeeks},
    author  = {GFG},
    year    = {2024},
    url     = {https://www.geeksforgeeks.com},
    note    = {Accessed: April 12 , 2024}
}

@book{algosbook1,
    author    = {Cormen, Leiseron, Rivest and Stein},
    title     = {Introduction to Algorithms, 2nd ed.},
    publisher = {MIT},
    year      = {2001},
    isbn      = {0-262-03293-7}
}



@article{likic2008needleman,
  title={The Needleman-Wunsch algorithm for sequence alignment},
  author={Likic, Vladimir},
  journal={Lecture given at the 7th Melbourne Bioinformatics Course, Bi021 Molecular Science and Biotechnology Institute, University of Melbourne},
  pages={1--46},
  year={2008}
}

@misc{abdulla2018dynamic,
author = {Neissery Abdulla, Sajil},
year = {2018},
month = {11},
pages = {2--5},
title = {Dynamic programming}
}



@incollection{REVEILLAC201555,
title = {4 - Dynamic Programming},
editor = {Jean-Michel Réveillac},
booktitle = {Optimization Tools for Logistics},
publisher = {Elsevier},
pages = {55-75},
year = {2015},
isbn = {978-1-78548-049-2},
doi = {https://doi.org/10.1016/B978-1-78548-049-2.50004-9},
url = {https://www.sciencedirect.com/science/article/pii/B9781785480492500049},
author = {Jean-Michel Réveillac},
keywords = {Chain, Dynamic programming, Ehrenfest model, Fibonacci sequence, Graph, Knapsack, Levenshtein distance, Markov chains, Matrix}
}

@article{kadane2023two,
  title={Two Kadane Algorithms for the Maximum Sum Subarray Problem},
  author={Kadane, Joseph B},
  journal={Algorithms},
  volume={16},
  number={11},
  pages={519},
  year={2023},
  publisher={MDPI}
}