{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:23:14Z","timestamp":1742401394389},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422426"},{"type":"electronic","value":"9783540457275"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45727-5_11","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:25:28Z","timestamp":1184588728000},"page":"126-134","source":"Crossref","is-referenced-by-count":8,"title":["Tree Reconstruction via a Closure Operation on Partial Splits"],"prefix":"10.1007","author":[{"given":"Charles","family":"Semple","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Steel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"key":"11_CR1","unstructured":"B\u00f6cker, S., Bryant, D., Dress, A. W. M., and Steel, M. A.: Algorithmic aspects of tree amalgamation. To appear in Journal of Algorithms."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01609870","volume":"3","author":"S. B\u00f6cker","year":"1999","unstructured":"B\u00f6cker, S., Dress, A. W. M., and Steel, M.: Patching up X-trees. Annals of Combinatorics\n                        3 (1999) 1\u201312.","journal-title":"Annals of Combinatorics"},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","first-page":"273","volume-title":"Proceedings of the International Colloquium on Automata, Languages and Programming","author":"H. L. Bodlaender","year":"1993","unstructured":"Bodlaender, H. L., Fellows, M. R., and Warnow, T. J.: Two strikes against perfect phylogeny. In Proceedings of the International Colloquium on Automata, Languages and Programming, Vol. 623 of Lecture Notes in Computer Science, Springer-Verlag, Berlin (1993) 273\u2013283."},{"key":"11_CR4","unstructured":"Buneman, P.: The recovery of trees from measures of dissimilarity. In F. R. Hodson, D. G. Kendall, and P. Tautu (eds.): Mathematics in the Archaeological and Historical Sciences, Edinburgh University Press (1971) 387\u2013395."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Meacham, C. A.: Theoretical and computational considerations of the compatibility of qualitative taxonomic characters. In J. Felsenstein (ed.): Numerical Taxonomy, NATO ASI Series Vol. G1, Springer-Verlag (1983) 304\u2013314.","DOI":"10.1007\/978-3-642-69024-2_34"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification\n                        9(1) (1992) 91\u2013116.","journal-title":"Journal of Classification"}],"container-title":["Lecture Notes in Computer Science","Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45727-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:07:16Z","timestamp":1550434036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45727-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422426","9783540457275"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-45727-5_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}