{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:46:30Z","timestamp":1742996790376,"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_221","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:29Z","timestamp":1214505329000},"page":"495-497","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Agreement Subtree (of 3 or More Trees)"],"prefix":"10.1007","author":[{"given":"Teresa M.","family":"Przytycka","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"221_CR1_221","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\u00a0set of evolutionary trees: Metrics and efficient algorithms. SIAM J. Comput. 26(6), 1656\u20131669 (1997)","journal-title":"SIAM J. Comput."},{"key":"221_CR2_221","volume-title":"Proc. of the 11th Annual International Conference on Computing and Combinatorics (COCOON'05). LNCS, vol. 3595, pp. 115\u2013125","author":"V. Berry","year":"2005","unstructured":"Berry, V., Guillemot, S., Nicolas, F., Paul, C.: On the approximation of computing evolutionary trees. In: COCOON, pp.\u00a0115\u2013125. (2005)"},{"issue":"3","key":"221_CR3_221","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1109\/TCBB.2006.39","volume":"3","author":"V. Berry","year":"2006","unstructured":"Berry, V., Nicolas, F.: Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems. IEEE\/ACM Trans. Comput. Biology Bioinform. 3(3), 289\u2013302 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"221_CR4_221","unstructured":"Bryand, D.: Building trees, hunting for trees, and comparing trees: theory and methods in phylogenetic analysis. In: Ph.\u202fD. thesis, Dept. Math., University of Canterbury (1997)"},{"issue":"5","key":"221_CR5_221","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 \\log n) } $$ algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Comput., pp.\u00a01385\u20131404. (2001)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"221_CR6_221","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. 55(6), 297\u2013301 (1995)","journal-title":"Inf. Process. Lett."},{"key":"221_CR7_221","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"C.R. Finden","year":"1985","unstructured":"Finden, C.R., Gordon, A.D.: Obtaining common pruned trees. J.\u00a0Classific. 2, 255\u2013276 (1985)","journal-title":"J. Classific."},{"issue":"2","key":"221_CR8_221","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":"221_CR9_221","unstructured":"Lee, C.-M., Hung, L.-J., Chang, M.-S., Tang, C.-Y.: An improved algorithm for the maximum agreement subtree problem. BIBE, p.\u00a0533 (2004)"},{"issue":"2","key":"221_CR10_221","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1089\/cmb.1998.5.335","volume":"5","author":"T.M. Przytycka","year":"1998","unstructured":"Przytycka, T.M.: Transforming rooted agreement into unrooted agreement. J.\u00a0Comput. Biol. 5(2), 335\u2013349 (1998)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"221_CR11_221","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","volume":"48","author":"M.A. Steel","year":"1993","unstructured":"Steel, M.A., Warnow, T.: Kaikoura tree theorems: Computing the maximum agreement subtree. Inf. Process. Lett. 48(2), 77\u201382 (1993)","journal-title":"Inf. Process. Lett."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:19:23Z","timestamp":1662175163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_221"}},"subtitle":["1995; Farach, Przytycka, Thorup"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_221","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}