{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:34:31Z","timestamp":1725564871872},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202028"},{"type":"electronic","value":"9783540451938"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45193-8_63","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:35:03Z","timestamp":1283974503000},"page":"837-841","source":"Crossref","is-referenced-by-count":6,"title":["Supertree Construction with Constraint Programming"],"prefix":"10.1007","author":[{"given":"Ian P.","family":"Gent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara M.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1006\/aama.1995.1020","volume":"16","author":"D. Bryant","year":"1995","unstructured":"Bryant, D., Steel, M.: Extension Operations on Sets of Leaf-labeled Trees. Advances in Applied Mathematics\u00a016, 425\u2013453 (1995)","journal-title":"Advances in Applied Mathematics"},{"key":"63_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"M.P. Ng","year":"1996","unstructured":"Ng, M.P., Wormald, N.C.: Reconstruction of rooted trees from subtrees. Discrete Applied Mathematics\u00a069, 19\u201331 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"63_CR4","first-page":"361","volume":"15","author":"E. Schr\u00f6der","year":"1870","unstructured":"Schr\u00f6der, E.: Vier combinatorische probleme. Zeit. f\u00fcr Math. Phys.\u00a015, 361\u2013376 (1870)","journal-title":"Zeit. f\u00fcr Math. Phys."},{"key":"63_CR5","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(00)00202-X","volume":"105","author":"C. Semple","year":"2000","unstructured":"Semple, C., Steel, M.: A supertree method for rooted trees. Discrete Applied Mathematics\u00a0105, 147\u2013158 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"63_CR6","unstructured":"Thorley, J.L.: Cladistic information, leaf stability and supertree construction. PhD Thesis, University of Bristol, Department of Biological Sciences (2000)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45193-8_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T02:15:01Z","timestamp":1553048101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45193-8_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202028","9783540451938"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45193-8_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}