{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T12:36:03Z","timestamp":1771072563232,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642404528","type":"print"},{"value":"9783642404535","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40453-5_13","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:09:49Z","timestamp":1376622589000},"page":"156-169","source":"Crossref","is-referenced-by-count":19,"title":["The Generalized Robinson-Foulds Metric"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"B\u00f6cker","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Canzar","sequence":"additional","affiliation":[]},{"given":"Gunnar W.","family":"Klau","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_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 Combinatorics\u00a05, 1\u201315 (2001)","journal-title":"Annals Combinatorics"},{"issue":"48","key":"13_CR2","doi-asserted-by":"publisher","first-page":"6634","DOI":"10.1016\/j.tcs.2011.08.027","volume":"412","author":"M.S. Bansal","year":"2011","unstructured":"Bansal, M.S., Dong, J., Fern\u00e1ndez-Baca, D.: Comparing and aggregating partially resolved trees. Theor. Comput. Sci.\u00a0412(48), 6634\u20136652 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Bogdanowicz, D.: Comparing phylogenetic trees using a minimum weight perfect matching. In: Proc. of Information Technology (IT 2008), pp. 1\u20134 (2008)","DOI":"10.1109\/INFTECH.2008.4621680"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TCBB.2011.48","volume":"9","author":"D. Bogdanowicz","year":"2012","unstructured":"Bogdanowicz, D., Giaro, K.: Matching split distance for unrooted binary phylogenetic trees. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a09(1), 150\u2013160 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Canzar, S., Elbassioni, K., Klau, G., Mestre, J.: On tree-constrained matchings and generalizations. Algorithmica, 1\u201322 (2013)","DOI":"10.1007\/s00453-013-9785-0"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1093\/sysbio\/45.3.323","volume":"45","author":"D.E. Critchlow","year":"1996","unstructured":"Critchlow, D.E., Pearl, D.K., Qian, C.: The triples distance for rooted bifurcating phylogenetic trees. Syst. Biol.\u00a045(3), 323\u2013334 (1996)","journal-title":"Syst. Biol."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19222-7_1","volume-title":"Combinatorial Algorithms","author":"K. Dabrowski","year":"2011","unstructured":"Dabrowski, K., Lozin, V.V., M\u00fcller, H., Rautenbach, D.: Parameterized algorithms for the independent set problem in some hereditary graph classes. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol.\u00a06460, pp. 1\u20139. Springer, Heidelberg (2011)"},{"key":"13_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of Cuts and Metrics","author":"M. Deza","year":"1997","unstructured":"Deza, M., Laurent, M.: Geometry of Cuts and Metrics. Springer, New York (1997)"},{"key":"13_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0166-218X(90)90020-D","volume":"26","author":"O. Dubois","year":"1990","unstructured":"Dubois, O.: On the r, s-SAT satisfiability problem and a conjecture of Tovey. Discrete Applied Mathematics\u00a026(1), 51\u201360 (1990)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"C. Finden","year":"1985","unstructured":"Finden, C., Gordon, A.: Obtaining common pruned trees. J. Classif.\u00a02(1), 255\u2013276 (1985)","journal-title":"J. Classif."},{"issue":"20","key":"13_CR12","doi-asserted-by":"publisher","first-page":"2399","DOI":"10.1093\/bioinformatics\/btn364","volume":"24","author":"T. Griebel","year":"2008","unstructured":"Griebel, T., Brinkmeyer, M., B\u00f6cker, S.: EPoS: A modular software framework for phylogenetic analysis. Bioinformatics\u00a024(20), 2399\u20132400 (2008)","journal-title":"Bioinformatics"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/jagm.2001.1163","volume":"40","author":"M.-Y. Kao","year":"2001","unstructured":"Kao, M.-Y., Lam, T.W., Sung, W.-K., Ting, H.-F.: An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings. J. Algorithms\u00a040(2), 212\u2013233 (2001)","journal-title":"J. Algorithms"},{"issue":"6","key":"13_CR14","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1080\/10635150500354852","volume":"54","author":"L.A. Lewis","year":"2005","unstructured":"Lewis, L.A., Lewis, P.O.: Unearthing the molecular phylodiversity of desert soil green algae (Chlorophyta). Syst. Biol.\u00a054(6), 936\u2013947 (2005)","journal-title":"Syst. Biol."},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1109\/TCBB.2011.157","volume":"9","author":"Y. Lin","year":"2012","unstructured":"Lin, Y., Rajan, V., Moret, B.M.E.: A metric for phylogenetic trees based on matching. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a09(4), 1014\u20131022 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"issue":"3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/882262.882291","volume":"22","author":"T. Munzner","year":"2003","unstructured":"Munzner, T., Guimbreti\u00e8re, F., Tasiran, S., Zhang, L., Zhou, Y.: TreeJuxtaposer: Scalable tree comparison using focus+context with guaranteed visibility. ACM Trans. Graph.\u00a022(3), 453\u2013462 (2003)","journal-title":"ACM Trans. Graph."},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/bioinformatics\/bti720","volume":"22","author":"T.M.W. Nye","year":"2006","unstructured":"Nye, T.M.W., Li\u00f2, P., Gilks, W.R.: A novel algorithm and web-based tool for comparing two alternative phylogenetic trees. Bioinformatics\u00a022(1), 117\u2013119 (2006)","journal-title":"Bioinformatics"},{"issue":"1-2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D.F. Robinson","year":"1981","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Math. Biosci.\u00a053(1-2), 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/978-3-540-87744-8_66","volume-title":"Algorithms - ESA 2008","author":"S.-J. Sul","year":"2008","unstructured":"Sul, S.-J., Williams, T.L.: An experimental analysis of robinson-foulds distance matrix algorithms. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 793\u2013804. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40453-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:50:54Z","timestamp":1558025454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40453-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404528","9783642404535"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40453-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}