{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T20:40:09Z","timestamp":1745527209053,"version":"3.40.4"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031902512","type":"print"},{"value":"9783031902529","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-90252-9_20","type":"book-chapter","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T20:03:12Z","timestamp":1745524992000},"page":"273-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Tree Labeling Polytope: A\u00a0Unified Approach to\u00a0Ancestral Reconstruction Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0132-3472","authenticated-orcid":false,"given":"Henri","family":"Schmidt","sequence":"first","affiliation":[]},{"given":"Benjamin J.","family":"Raphael","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,25]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/BF01681346","volume":"9","author":"D Sankoff","year":"1975","unstructured":"Sankoff, D., Rousseau, P.: Locating the vertices of a Steiner tree in an arbitrary metric space. Math. Program. 9, 240\u2013246 (1975)","journal-title":"Math. Program."},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-87989-3_6","volume-title":"Comparative Genomics","author":"M Cs\u0171r\u00f6s","year":"2008","unstructured":"Cs\u0171r\u00f6s, M.: Ancestral reconstruction by asymmetric wagner parsimony over continuous characters and squared parsimony over distributions. In: Nelson, C.E., Vialette, S. (eds.) RECOMB-CG 2008. LNCS, vol. 5267, pp. 72\u201386. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87989-3_6"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-36478-1_2","volume-title":"Combinatorial Optimization \u2014 Eureka, You Shrink!","author":"J Edmonds","year":"2003","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization \u2014 Eureka, You Shrink! LNCS, vol. 2570, pp. 11\u201326. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36478-1_2"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Goemans, M.X.: Minimum bounded degree spanning trees. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.\u00a0273\u2013282. IEEE (2006)","DOI":"10.1109\/FOCS.2006.48"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629366","volume":"62","author":"M Singh","year":"2015","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. J. ACM (JACM) 62(1), 1\u201319 (2015)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0377-2217(89)90169-0","volume":"39","author":"A Volgenant","year":"1989","unstructured":"Volgenant, A.: A Lagrangean approach to the degree-constrained minimum spanning tree problem. Eur. J. Oper. Res. 39(3), 325\u2013331 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s10589-015-9788-7","volume":"63","author":"LH Bicalho","year":"2016","unstructured":"Bicalho, L.H., Da Cunha, A.S., Lucena, A.: Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem. Comput. Optim. Appl. 63, 755\u2013792 (2016)","journal-title":"Comput. Optim. Appl."},{"key":"20_CR8","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Hoboken (1998)"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90252-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T20:03:14Z","timestamp":1745524994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90252-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031902512","9783031902529"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90252-9_20","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":"25 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","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":"26 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb.org\/recomb2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}