{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:03:21Z","timestamp":1725487401429},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_3","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:25:28Z","timestamp":1184588728000},"page":"24-31","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Agreement Supertrees"],"prefix":"10.1007","author":[{"given":"David","family":"Bryant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1089\/cmb.1996.3.275","volume":"3","author":"D. Bryant","year":"1996","unstructured":"Bryant, D.: Hunting for trees in binary character sets. Journal of Computational Biology 3(2), (1996) 275\u2013288.","journal-title":"Journal of Computational Biology"},{"key":"3_CR2","unstructured":"Bryant, D.: Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis. Ph.D. thesis, Dept. Mathematics, University of Canterbury (1997)."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"C.R. Finden","year":"1986","unstructured":"Finden, C.R. and Gordon. A.D. Obtaining common pruned trees. Journal of Classification, 2 (1986) 255\u2013276.","journal-title":"Journal of Classification"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF01894195","volume":"3","author":"A.D. Gordon","year":"1986","unstructured":"Gordon, A.D. Consensus supertrees: the synthesis of rooted trees containing over-lapping sets of leaves. Journal of Classification, 3 (1986) 335\u2013348.","journal-title":"Journal of Classification"},{"key":"3_CR5","unstructured":"Bryant, D. Fast algorithms for constructing optimal trees with respect to OLS and minimum evolution criteria. In preparation."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0025-5564(94)90012-4","volume":"123","author":"W. Goddard","year":"1994","unstructured":"Goddard, W., Kubicka, E., Kubicki, G., and McMorris, F.R.. (1994). The agreement metric for labelled binary trees. Mathematical Biosciences 123 215\u2013226.","journal-title":"Mathematical Biosciences"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Bryant, D. and Steel, M. Constructing optimal trees from quartets. Journal of Algorithms (to appear)","DOI":"10.1006\/jagm.2000.1133"},{"key":"3_CR8","unstructured":"D.H. Huson, S. Nettles, and T. Warnow: Obtaining highly accurate topology estimates of evolutionary trees from very short sequences. Proc. 3rd Annual Int. Conf. Comp. Mol. Biol. (RECOMB), (1998) 198\u2013209."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"M. Steel: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, 9 (1992) 91\u2013116.","journal-title":"Journal of Classification"},{"key":"3_CR10","first-page":"407","volume-title":"Molecular Systematics","author":"D. L. Swofford","year":"1996","unstructured":"Swofford, D. L., G. J. Olsen, P. J. Waddell and D. M. Hillis: Phylogenetic Inference. in D. M. Hillis, C. Moritz, and B. K. Mable, eds. Molecular Systematics, second edition. Sinauer, Sunderland, Mass (1996) 407\u2013514.","edition":"second edition"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:53:08Z","timestamp":1550436788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45727-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422426","9783540457275"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45727-5_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}