{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:29:03Z","timestamp":1725751743806},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319026237"},{"type":"electronic","value":"9783319026244"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-02624-4_8","type":"book-chapter","created":{"date-parts":[[2013,10,12]],"date-time":"2013-10-12T02:21:00Z","timestamp":1381544460000},"page":"82-93","source":"Crossref","is-referenced-by-count":3,"title":["How to Multiply Dynamic Programming Algorithms"],"prefix":"10.1007","author":[{"given":"Christian","family":"H\u00f6ner zu Siederdissen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivo L.","family":"Hofacker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"8_CR1","doi-asserted-by":"publisher","first-page":"4412","DOI":"10.1073\/pnas.86.12.4412","volume":"86","author":"D.J. Lipman","year":"1989","unstructured":"Lipman, D.J., Altschul, S.F., Kececioglu, J.D.: A tool for multiple sequence alignment. Proc. Natl. Acad. Sci. USA\u00a086(12), 4412\u20134415 (1989)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"8_CR2","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)"},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.scico.2003.12.005","volume":"51","author":"R. Giegerich","year":"2004","unstructured":"Giegerich, R., Meyer, C., Steffen, P.: A Discipline of Dynamic Programming over Sequence Data. Science of Computer Programming\u00a051(3), 215\u2013263 (2004)","journal-title":"Science of Computer Programming"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/0022-2836(82)90398-9","volume":"162","author":"O. Gotoh","year":"1982","unstructured":"Gotoh, O.: An improved algorithm for matching biological sequences. J. Mol. Biol.\u00a0162, 705\u2013708 (1982)","journal-title":"J. Mol. Biol."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0022-5193(86)80112-6","volume":"121","author":"O. Gotoh","year":"1986","unstructured":"Gotoh, O.: Alignment of three biological sequences with an efficient traceback procedure. J. Theor. Biol.\u00a0121, 327\u2013337 (1986)","journal-title":"J. Theor. Biol."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1089\/106652701300312931","volume":"8","author":"T.G. Dewey","year":"2001","unstructured":"Dewey, T.G.: A sequence alignment algorithm with an arbitrary gap penalty function. J. Comp. Biol.\u00a08, 177\u2013190 (2001)","journal-title":"J. Comp. Biol."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1142\/S0219720004000831","volume":"2","author":"A.S. Konagurthu","year":"2004","unstructured":"Konagurthu, A.S., Whisstock, J., Stuckey, P.J.: Progressive multiple alignment using sequence triplet optimization and three-residue exchange costs. J. Bioinf. and Comp. Biol.\u00a02, 719\u2013745 (2004)","journal-title":"J. Bioinf. and Comp. Biol."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1186\/1471-2105-8-254","volume":"8","author":"M. Kruspe","year":"2007","unstructured":"Kruspe, M., Stadler, P.F.: Progressive multiple sequence alignments from triplets. BMC Bioinformatics\u00a08, 254 (2007)","journal-title":"BMC Bioinformatics"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1163\/221058211X570358","volume":"1","author":"L. Steiner","year":"2011","unstructured":"Steiner, L., Stadler, P.F., Cysouw, M.: A pipeline for computational historical linguistics. Language Dynamics & Change\u00a01, 89\u2013127 (2011)","journal-title":"Language Dynamics & Change"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. 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. Journal of Molecular Biology\u00a048(3), 443\u2013453 (1970)","journal-title":"Journal of Molecular Biology"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Sankoff, D.: Simultaneous solution of the RNA folding, alignment and protosequence problems. SIAM Journal on Applied Mathematics, 810\u2013825 (1985)","DOI":"10.1137\/0145048"},{"key":"8_CR12","unstructured":"The GHC Team: The Glasgow Haskell Compiler (GHC) (1989\u20132013), \n                  \n                    http:\/\/www.haskell.org\/ghc\/"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Sheard, T., Jones, S.P.: Template Meta-programming for Haskell. In: Proceedings of the 2002 ACM SIGPLAN Workshop on Haskell, pp. 1\u201316. ACM (2002)","DOI":"10.1145\/581690.581691"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Coutts, D., Leshchinskiy, R., Stewart, D.: Stream Fusion: From Lists to Streams to Nothing at All. In: Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, ICFP 2007, pp. 315\u2013326. ACM (2007)","DOI":"10.1145\/1291151.1291199"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"H\u00f6ner zu 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_CR16","doi-asserted-by":"crossref","unstructured":"Mainland, G., Leshchinskiy, R., Jones, S.P., Marlow, S.: Exploiting vector instructions with generalized stream fusion. In: Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming (2013)","DOI":"10.1145\/2500365.2500601"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Keller, G., Chakravarty, M.M., Leshchinskiy, R., Peyton Jones, S., Lippmeier, B.: Regular, Shape-polymorphic, Parallel Arrays in Haskell. In: Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010, pp. 261\u2013272. ACM (2010)","DOI":"10.1145\/1863543.1863582"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1186\/1471-2105-6-224","volume":"6","author":"P. Steffen","year":"2005","unstructured":"Steffen, P., Giegerich, R.: Versatile and declarative dynamic programming using pair algebras. BMC Bioinformatics\u00a06(1), 224 (2005)","journal-title":"BMC Bioinformatics"}],"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-02624-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T06:30:29Z","timestamp":1558593029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02624-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319026237","9783319026244"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02624-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}