{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T12:13:52Z","timestamp":1752668032395},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319124179"},{"type":"electronic","value":"9783319124186"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12418-6_8","type":"book-chapter","created":{"date-parts":[[2014,10,23]],"date-time":"2014-10-23T15:39:37Z","timestamp":1414078777000},"page":"57-64","source":"Crossref","is-referenced-by-count":6,"title":["Dynamic Programming for Set Data Types"],"prefix":"10.1007","author":[{"given":"Christian","family":"H\u00f6ner zu Siederdissen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonja J.","family":"Prohaska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-45719-4_24","volume-title":"Algebraic Methodology and Software Technology","author":"R. Giegerich","year":"2002","unstructured":"Giegerich, R., Meyer, C.: Algebraic dynamic programming. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol.\u00a02422, pp. 349\u2013364. Springer, Heidelberg (2002)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"H\u00f6ner\u00a0zu Siederdissen, C.: Sneaking around concatMap: efficient combinators for dynamic programming. In: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming, ICFP 2012, pp. 215\u2013226. ACM (2012)","DOI":"10.1145\/2364527.2364559"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Sauthoff, G., Janssen, S., Giegerich, R.: Bellman\u2019s GAP - A Declarative Language for Dynamic Programming. In: Proceedings of the 13th international ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming, PPDP 2011, pp. 29\u201340. ACM (2011)","DOI":"10.1145\/2003476.2003484"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"H\u00f6ner zu Siederdissen, C., Hofacker, I.L., Stadler, P.F.: Product Grammars for Alignment and Folding. IEEE\/ACM Trans. Comp. Biol. Bioinf. 99 (2014)","DOI":"10.1109\/TCBB.2014.2326155"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Giegerich, R., Touzet, H.: Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems. Algorithms, 62\u2013144 (2014)","DOI":"10.3390\/a7010062"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"H\u00f6ner zu Siederdissen, C., Hofacker, I.L.: Discriminatory power of RNA family models. Bioinformatics 26(18), 453\u2013459 (2010)","DOI":"10.1093\/bioinformatics\/btq370"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/1741-7007-4-5","volume":"4","author":"B. Vo\u00df","year":"2006","unstructured":"Vo\u00df, B., Giegerich, R., Rehmsmeier, M.: Complete probabilistic analysis of RNA shapes. BMC Biology\u00a04(1), 5 (2006)","journal-title":"BMC Biology"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R. Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM\u00a09, 61\u201363 (1962)","journal-title":"J. ACM"},{"key":"8_CR9","first-page":"196","volume":"10","author":"M. Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. SIAM\u00a010, 196\u2013201 (1962)","journal-title":"J. SIAM"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1002\/bip.360290621","volume":"29","author":"J.S. McCaskill","year":"1990","unstructured":"McCaskill, J.S.: The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers\u00a029, 1105\u20131119 (1990)","journal-title":"Biopolymers"},{"key":"8_CR11","unstructured":"Janssen, S.: Kisses, ambivalent models and more: Contributions to the analysis of RNA secondary structure. PhD thesis, Univ. Bielefeld (2014)"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Elemento, O., Gascuel, O.: An efficient and accurate distance based algorithm to reconstruct tandem duplication trees. Bioinformatics 8(suppl. 2), S92\u2013S99 (2002)","DOI":"10.1093\/bioinformatics\/18.suppl_2.S92"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/jez.b.21070","volume":"306","author":"R.A. Cameron","year":"2006","unstructured":"Cameron, R.A., Rowen, L., Nesbitt, R., Bloom, S., Rast, J.P., Berney, K., Arenas-Mena, C., Martinez, P., Lucas, S., Richardson, P.M., Davidson, E.H., Peterson, K.J., Hood, L.: Unusual gene order and organization of the sea urchin Hox cluster. J. Exp. Zoolog. B Mol. Dev. Evol.\u00a0306, 45\u201358 (2006)","journal-title":"J. Exp. Zoolog. B Mol. Dev. Evol."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-319-02624-4_8","volume-title":"Advances in Bioinformatics and Computational Biology","author":"C. H\u00f6ner zu Siederdissen","year":"2013","unstructured":"H\u00f6ner zu Siederdissen, C., Hofacker, I.L., Stadler, P.F.: How to multiply dynamic programming algorithms. In: Setubal, J.C., Almeida, N.F. (eds.) BSB 2013. LNCS, vol.\u00a08213, pp. 82\u201393. Springer, Heidelberg (2013)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"McBride, C.: Clowns to the left of me, jokers to the right (pearl): dissecting data structures. In: ACM SIGPLAN Notices, vol.\u00a043, pp. 287\u2013295. ACM (2008)","DOI":"10.1145\/1328897.1328474"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12418-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T06:56:05Z","timestamp":1559026565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12418-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319124179","9783319124186"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12418-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}