{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:28:13Z","timestamp":1725582493812},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212598"},{"type":"electronic","value":"9783642212604"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21260-4_21","type":"book-chapter","created":{"date-parts":[[2011,4,29]],"date-time":"2011-04-29T04:26:59Z","timestamp":1304051219000},"page":"197-208","source":"Crossref","is-referenced-by-count":3,"title":["A Metric for Phylogenetic Trees Based on Matching"],"prefix":"10.1007","author":[{"given":"Yu","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaibhav","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard M. E.","family":"Moret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B.L. Allen","year":"2001","unstructured":"Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics\u00a05(1), 1\u201315 (2001)","journal-title":"Annals of Combinatorics"},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"A. Amir","year":"1997","unstructured":"Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms. SIAM J. Computing\u00a026(6), 1656\u20131669 (1997)","journal-title":"SIAM J. Computing"},{"key":"21_CR3","unstructured":"Bryant, D.: Hunting for trees, building trees and comparing trees: Theory and method in phylogenetic analysis. PhD thesis, University of Canterbury (1997)"},{"issue":"3","key":"21_CR4","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TCBB.2009.32","volume":"6","author":"D. Bryant","year":"2009","unstructured":"Bryant, D., Steel, M.: Computing the distribution of a tree metric. ACM\/IEEE Trans. on Comput. Biology and Bioinformatics\u00a06(3), 420\u2013426 (2009)","journal-title":"ACM\/IEEE Trans. on Comput. Biology and Bioinformatics"},{"issue":"5","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1137\/S0097539796313477","volume":"30","author":"R. Cole","year":"2000","unstructured":"Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., Thorup, M.: An O(n\n                log\n                n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Computing\u00a030(5), 1385\u20131404 (2000)","journal-title":"SIAM J. Computing"},{"key":"21_CR6","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Zhang, L.: On distances between phylogenetic trees. In: Proc. 8th ACM\/SIAM Symp. Discrete Algs. (SODA 1997), pp. 427\u2013436 (1997)"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01908061","volume":"2","author":"W.H.E. Day","year":"1985","unstructured":"Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. J. Classification\u00a02(1), 7\u201328 (1985)","journal-title":"J. Classification"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM\u00a019(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"issue":"6","key":"21_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(95)00110-X","volume":"55","author":"M. Farach","year":"1995","unstructured":"Farach, M., Przytycka, T.M., Thorup, M.: On the agreement of many trees. Inf. Process. Lett.\u00a055(6), 297\u2013301 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1137\/0218069","volume":"18","author":"H.N. Gabow","year":"1989","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM J. Computing\u00a018(5), 1013\u20131036 (1989)","journal-title":"SIAM J. Computing"},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.4137\/EBO.S419","volume":"4","author":"G. Hickey","year":"2008","unstructured":"Hickey, G., Dehne, F., Rau-Chaplin, A., Blouin, C.: SPR distance computation of unrooted trees. Evol. Bioinform. Online\u00a04, 17\u201327 (2008)","journal-title":"Evol. Bioinform. Online"},{"issue":"6","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1137\/S0097539795283504","volume":"27","author":"M.Y. Kao","year":"1998","unstructured":"Kao, M.Y.: Tree contractions and evolutionary trees. SIAM J. Computing\u00a027(6), 1592\u20131616 (1998)","journal-title":"SIAM J. Computing"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1006\/jtbi.1996.0188","volume":"182","author":"M. Li","year":"1996","unstructured":"Li, M., Tromp, J., Zhang, L.: On the nearest-neighbour interchange distance between evolutionary trees. J. Theor. Biol.\u00a0182(4), 463\u2013467 (1996)","journal-title":"J. Theor. Biol."},{"issue":"6","key":"21_CR14","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1089\/cmb.2007.R012","volume":"14","author":"N.D. Pattengale","year":"2007","unstructured":"Pattengale, N.D., Gottlieb, E.J., Moret, B.M.E.: Efficiently computing the Robinson-Foulds metric. J. Comput. Biol.\u00a014(6), 724\u2013735 (2007)","journal-title":"J. Comput. Biol."},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-13078-6_16","volume-title":"Bioinformatics Research and Applications","author":"N.D. Pattengale","year":"2010","unstructured":"Pattengale, N.D., Swenson, K.M., Moret, B.M.E.: Uncovering hidden phylogenetic consensus. In: Borodovsky, M., Gogarten, J.P., Przytycka, T.M., Rajasekaran, S. (eds.) ISBRA 2010. LNCS, vol.\u00a06053, pp. 128\u2013139. Springer, Heidelberg (2010)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D.R. Robinson","year":"1981","unstructured":"Robinson, D.R., Foulds, L.R.: Comparison of phylogenetic trees. Mathematical Biosciences\u00a053, 131\u2013147 (1981)","journal-title":"Mathematical Biosciences"},{"issue":"2","key":"21_CR17","first-page":"126","volume":"42","author":"M. Steel","year":"1993","unstructured":"Steel, M., Penny, D.: Distributions of tree comparison metrics\u2014some new results. Syst. Biol.\u00a042(2), 126\u2013141 (1993)","journal-title":"Syst. Biol."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","volume":"48","author":"M. Steel","year":"1993","unstructured":"Steel, M., Warnow, T.: Kaikoura tree theorems: computing maximum agreement subtree problem. Information Processing Letters\u00a048, 77\u201382 (1993)","journal-title":"Information Processing Letters"},{"key":"21_CR19","series-title":"Bioinformatics","first-page":"285","volume-title":"Proc. 10th Conf. Intelligent Systems for Mol. Biol. (ISMB 2002)","author":"C. Stockham","year":"2002","unstructured":"Stockham, C., Wang, L.-S., Warnow, T.: Statistically-based postprocessing of phylogenetic analysis using clustering. In: Proc. 10th Conf. Intelligent Systems for Mol. Biol. (ISMB 2002). Bioinformatics, vol.\u00a018, pp. S285\u2013S293. Oxford U. Press, Oxford (2002)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Whidden, C., Zeh, N.: A unifying view on approximation and fpt of agreement forests. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 390\u2013402. Springer, Heidelberg (2006)","DOI":"10.1007\/978-3-642-04241-6_32"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21260-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:31:52Z","timestamp":1558589512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21260-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212598","9783642212604"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21260-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}