乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:20:49Z","timestamp":1725769249244},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,7,20]]},"DOI":"10.1145\/2003476.2003484","type":"proceedings-article","created":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T12:34:54Z","timestamp":1311165294000},"page":"29-40","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Bellman's GAP"],"prefix":"10.1145","author":[{"given":"Georg","family":"Sauthoff","sequence":"first","affiliation":[{"name":"Universit\u00e4t Bielefeld, Bielefeld, Germany"}]},{"given":"Stefan","family":"Janssen","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bielefeld, Bielefeld, Germany"}]},{"given":"Robert","family":"Giegerich","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Bielefeld, Bielefeld, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720009004060"},{"key":"e_1_3_2_1_2_1","volume-title":"Dynamic Programming","author":"Bellman R. E.","year":"1957","unstructured":"R. E. Bellman . Dynamic Programming . Princeton University Press , 1957 . R. E. Bellman. Dynamic Programming. Princeton University Press, 1957."},{"key":"e_1_3_2_1_3_1","first-page":"56","volume-title":"Proc. of the 5th ISCB","author":"Birney E.","year":"1997","unstructured":"E. Birney and R. Durbin . Dynamite: A flexible code generating language for dynamic programming methods used in sequence comparison . In Proc. of the 5th ISCB , pages 56 -- 64 , 1997 . E. Birney and R. Durbin. Dynamite: A flexible code generating language for dynamic programming methods used in sequence comparison. In Proc. of the 5th ISCB, pages 56--64, 1997."},{"key":"e_1_3_2_1_4_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3115\/1220575.1220611"},{"key":"e_1_3_2_1_6_1","volume-title":"Jan.","author":"Gardner P. P.","year":"2009","unstructured":"P. P. Gardner , J. Daub , J. G. Tate , E. P. Nawrocki , D. L. Kolbe , S. Lindgreen , A. C. Wilkinson , R. D. Finn , S. Griffiths-Jones , S. R. Eddy , and A. Bateman . Rfam: updates to the RNA families database. Nucl. Acids Res., 37(suppl_1):D136--140 , Jan. 2009 . P. P. Gardner, J. Daub, J. G. Tate, E. P. Nawrocki, D. L. Kolbe, S. Lindgreen, A. C. Wilkinson, R. D. Finn, S. Griffiths-Jones, S. R. Eddy, and A. Bateman. Rfam: updates to the RNA families database. Nucl. Acids Res., 37(suppl_1):D136--140, Jan. 2009."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/16.8.665"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"R.\n Giegerich\n and \n C.\n Meyer\n . \n Algebraic Dynamic Programming\n . In H. Kirchner and C. Ringeissen editors AMAST\n 2002 volume \n 2422\n of \n Springer Lecture Notes in Computer Science pages \n 349\n --\n 364 2002. R. Giegerich and C. Meyer. Algebraic Dynamic Programming. In H. Kirchner and C. Ringeissen editors AMAST 2002 volume 2422 of Springer Lecture Notes in Computer Science pages 349--364 2002.","DOI":"10.1007\/3-540-45719-4_24"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2003.12.005"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1988783.1988790"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141277.1141653"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh779"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2010.12"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00818163"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(82)90223-2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp157"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1098690"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-5-104"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1261\/rna.5248604"},{"key":"e_1_3_2_1_21_1","volume-title":"Bellman's gap language report. Technical report","author":"Sauthoff G.","year":"2010","unstructured":"G. Sauthoff and R. Giegerich . Bellman's gap language report. Technical report , Bielefeld University , 2010 . G. Sauthoff and R. Giegerich. Bellman's gap language report. Technical report, Bielefeld University, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-6-224"},{"key":"e_1_3_2_1_23_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/978-3-642-15294-8_5","volume-title":"Algorithms in Bioinformatics","author":"Theis C.","year":"2010","unstructured":"C. Theis , S. Janssen , and R. Giegerich . Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs . In V. Moulton and M. Singh, editors, Algorithms in Bioinformatics , volume 6293 of Lecture Notes in Computer Science , chapter 5, pages 52 -- 64 . Springer Berlin \/ Heidelberg , Berlin, Heidelberg , 2010 . C. Theis, S. Janssen, and R. Giegerich. Prediction of RNA Secondary Structure Including Kissing Hairpin Motifs. In V. Moulton and M. Singh, editors, Algorithms in Bioinformatics, volume 6293 of Lecture Notes in Computer Science, chapter 5, pages 52--64. Springer Berlin \/ Heidelberg, Berlin, Heidelberg, 2010."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/9.1.133"}],"event":{"name":"PPDP '11: Symposium on Principles and Practices of Declarative Programming","sponsor":["University of Southern Denmark","Danish Agency for Science Technology and Innovation DASTI","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Odense Denmark","acronym":"PPDP '11"},"container-title":["Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2003476.2003484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,12]],"date-time":"2023-01-12T23:06:27Z","timestamp":1673564787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2003476.2003484"}},"subtitle":["a declarative language for dynamic programming"],"short-title":[],"issued":{"date-parts":[[2011,7,20]]},"references-count":23,"alternative-id":["10.1145\/2003476.2003484","10.1145\/2003476"],"URL":"https:\/\/doi.org\/10.1145\/2003476.2003484","relation":{},"subject":[],"published":{"date-parts":[[2011,7,20]]},"assertion":[{"value":"2011-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}