{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:38:09Z","timestamp":1743129489374,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":11,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_222","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:29Z","timestamp":1214505329000},"page":"497-499","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Agreement Supertree"],"prefix":"10.1007","author":[{"given":"Wing-Kin","family":"Sung","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"222_CR1_222","doi-asserted-by":"crossref","unstructured":"Berry, V., Nicolas, F.: Maximum agreement and compatible supertrees. J.\u00a0Discret. Algorithms (2006)","DOI":"10.1016\/j.jda.2006.08.005"},{"key":"222_CR2_222","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1146\/annurev.ecolsys.33.010802.150511","volume":"33","author":"O. Bininda-Emonds","year":"2002","unstructured":"Bininda-Emonds, O., Gittleman, J., Steel, M.: The (super)tree of life: Procedures, problems, and prospects. Ann. Rev. Ecol. System. 33, 265\u2013289 (2002)","journal-title":"Ann. Rev. Ecol. System."},{"key":"222_CR3_222","doi-asserted-by":"crossref","unstructured":"Chor, B., Hendy, M., Penny, D.: Analytic solutions for three-taxon MLMC trees with variable rates across sites. In: Proceedings of the 1st Workshop on Algorithms in Bioinformatics (WABI 2001). Lecture Notes in Computer Science, vol.\u00a02149, pp.\u00a0204\u2013213. Springer (2001)","DOI":"10.1007\/3-540-44696-6_16"},{"key":"222_CR4_222","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., Thorup, M.: On the agreement of many trees. Information Process. Lett. 55, 297\u2013301 (1995)","journal-title":"Information Process. Lett."},{"key":"222_CR5_222","unstructured":"Guillemot, S., Berry, V.: Fixed-parameter tractability of the maximum agreement supertrees. In: Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007). Lecture Notes in Computer Science. Springer, (2007)"},{"issue":"1","key":"222_CR6_222","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009268","volume":"24","author":"M.R. Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V., Warnow, T.: Constructing a\u00a0tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica 24(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"key":"222_CR7_222","unstructured":"Hoang, V.T., Sung, W.K.: Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees. In: Albers, S., Weil, P., 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008). Dagstuhl, Germany (2007)"},{"issue":"4","key":"222_CR8_222","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00453-004-1147-5","volume":"43","author":"J. Jansson","year":"2005","unstructured":"Jansson, J., Joseph, H., Ng, K., Sadakane, K., Sung, W.-K.: Rooted maximum agreement supertrees. Algorithmica 43(4), 293\u2013307 (2005)","journal-title":"Algorithmica"},{"issue":"2","key":"222_CR9_222","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.\u00a0Algorithms 40(2), 212\u2013233 (2001)","journal-title":"J. Algorithms"},{"key":"222_CR10_222","unstructured":"Kearney, P.: Phylogenetics and the quartet method. In: Jiang, T., Xu, Y., Zhang, M.Q. (eds.) Current Topics in Computational Molecular Biology. The MIT Press, Massachusetts, pp.\u00a0111\u2013133 (2002)"},{"issue":"3","key":"222_CR11_222","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0169-5347(97)01242-1","volume":"13","author":"M.J. Sanderson","year":"1998","unstructured":"Sanderson, M.J., Purvis, A., Henze, C.: Phylogenetic supertrees: assembling the trees of life. TRENDS in Ecology & Evolution, 13(3), 105\u2013109 (1998)","journal-title":"TRENDS in Ecology & Evolution"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:18:43Z","timestamp":1662175123000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_222"}},"subtitle":["2005; Jansson, Ng, Sadakane, Sung"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_222","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}