{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:10:08Z","timestamp":1751703008011,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031976346","type":"print"},{"value":"9783031976353","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97635-3_37","type":"book-chapter","created":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:42:22Z","timestamp":1751701342000},"page":"309-317","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From Recursion to\u00a0Parallelization: Plug & Play Dynamic Programming"],"prefix":"10.1007","author":[{"given":"Jiang","family":"Long","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,6]]},"reference":[{"issue":"6","key":"37_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1375581.1375595","volume":"43","author":"U Bondhugula","year":"2008","unstructured":"Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: Pluto: An automatic polyhedral parallelizer and locality optimizer. ACM SIGPLAN Notices 43(6), 101\u2013113 (2008). https:\/\/doi.org\/10.1145\/1375581.1375595","journal-title":"ACM SIGPLAN Notices"},{"key":"37_CR2","doi-asserted-by":"publisher","unstructured":"Cao, Y., Gupta, A., Liang, J., Turakhia, Y.: DP-HLS: a high-level synthesis framework for accelerating dynamic programming algorithms in bioinformatics. CoRR, abs\/2411.03398 (2024). https:\/\/doi.org\/10.48550\/arXiv.2411.03398, arXiv:2411.03398","DOI":"10.48550\/arXiv.2411.03398"},{"key":"37_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"issue":"1","key":"37_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: an industry standard API for shared-memory programming. IEEE Comput. Sci. Eng. 5(1), 46\u201355 (1998). https:\/\/doi.org\/10.1109\/99.660313","journal-title":"IEEE Comput. Sci. Eng."},{"key":"37_CR5","doi-asserted-by":"publisher","unstructured":"Esparza, J., Knoop, J.: Petri nets for dynamic programming. In: Application and Theory of Petri Nets, pp. 210\u2013229. Springer (2010). https:\/\/doi.org\/10.1109\/HICSS.2004.1265209","DOI":"10.1109\/HICSS.2004.1265209"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Giegerich, R., Meyer, C.: Algebraic dynamic programming. In: Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology, AMAST 2002, pp. 349\u2013364. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45719-4_24"},{"key":"37_CR7","doi-asserted-by":"publisher","unstructured":"Huang, T.-W., Lin, C.-X., Guo, G., Wong, M.: CPP-taskflow: fast task-based parallel programming using modern C++. In: 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 974\u2013983. IEEE (2019). https:\/\/doi.org\/10.1109\/IPDPS.2019.00105","DOI":"10.1109\/IPDPS.2019.00105"},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/3579371.3589060","volume":"27","author":"Y Liang","year":"2016","unstructured":"Liang, Y., Wang, H., Wolf, M., Zhou, S.: GenDP: a general-purpose framework for accelerating dynamic programming on gpus. IEEE Trans. Parallel Distrib. Syst. 27(1), 260\u2013274 (2016). https:\/\/doi.org\/10.1145\/3579371.3589060","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"37_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.3390\/e25020251","volume":"25","author":"PN Loxley","year":"2023","unstructured":"Loxley, P.N., Cheung, K.-W.: A dynamic programming algorithm for finding an optimal sequence of informative measurements. Entropy 25(2), 251 (2023). https:\/\/doi.org\/10.3390\/e25020251","journal-title":"Entropy"},{"key":"37_CR10","doi-asserted-by":"publisher","unstructured":"Maleki, S., Musuvathi, M., Mytkowicz, T.: Parallelizing dynamic programming through rank convergence. In: Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 219\u2013232. ACM (2014). https:\/\/doi.org\/10.1145\/2555243.2555264","DOI":"10.1145\/2555243.2555264"},{"issue":"3","key":"37_CR11","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48(3), 443\u2013453 (1970). https:\/\/doi.org\/10.1016\/0022-2836(70)90057-4","journal-title":"J. Mol. Biol."},{"key":"37_CR12","doi-asserted-by":"publisher","unstructured":"Rocklin, M.: Dask: parallel computation with blocked algorithms and task scheduling. In: Proceedings of the 14th Python in Science Conference, pp. 130\u2013136 (2015). https:\/\/doi.org\/10.25080\/Majora-7b98e3ed-013","DOI":"10.25080\/Majora-7b98e3ed-013"},{"key":"37_CR13","unstructured":"Lengauer, C., Grosser, T., Groesslinger, A.: Polly - performing polyhedral optimizations on a low-level intermediate representation. https:\/\/polly.llvm.org"},{"issue":"1","key":"37_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/nar\/9.1.133","volume":"9","author":"M Zuker","year":"1981","unstructured":"Zuker, M., Stiegler, P.: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Res. 9(1), 133\u2013148 (1981). https:\/\/doi.org\/10.1093\/nar\/9.1.133","journal-title":"Nucleic Acids Res."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97635-3_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T07:42:24Z","timestamp":1751701344000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97635-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031976346","9783031976353"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97635-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"6 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}