{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:57:00Z","timestamp":1725796620609},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_33","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"381-392","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for Maximum Agreement Forest on Multiple Trees"],"prefix":"10.1007","author":[{"given":"Feng","family":"Shi","sequence":"first","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"33_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D. Robinson","year":"1981","unstructured":"Robinson, D., Foulds, L.: Comparison of phylogenetic trees. Mathematical Biosciences\u00a053(1-2), 131\u2013147 (1981)","journal-title":"Mathematical Biosciences"},{"issue":"4","key":"33_CR2","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. Journal on Theoretical Biology\u00a0182(4), 463\u2013467 (1996)","journal-title":"Journal on Theoretical Biology"},{"key":"33_CR3","series-title":"Mathematics in the Archaeological and Historical Sciences","first-page":"387","volume-title":"The recovery of trees from measures of dissimilarity","year":"1971","unstructured":"Hodson, F., Kendall, D., Tauta, P. (eds.): The recovery of trees from measures of dissimilarity. Mathematics in the Archaeological and Historical Sciences, pp. 387\u2013395. Edinburgh University Press, Edinburgh (1971)"},{"key":"33_CR4","unstructured":"Swofford, D., Olsen, G., Waddell, P., Hillis, D.: Phylogenetic inference. In: Molecular Systematics, 2nd edn., pp. 407\u2013513. Sinauer Associates (1996)"},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"J. Hein","year":"1996","unstructured":"Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Applied Mathematics\u00a071, 153\u2013169 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B. Allen","year":"2001","unstructured":"Allen, B., 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":"4","key":"33_CR7","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M. Bordewich","year":"2005","unstructured":"Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics\u00a08(4), 409\u2013423 (2005)","journal-title":"Annals of Combinatorics"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-44666-4_19","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"E.M. Rodrigues","year":"2001","unstructured":"Rodrigues, E.M., Sagot, M.-F., Wakabayashi, Y.: Some approximation results for the maximum agreement forest problem. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, pp. 159\u2013169. Springer, Heidelberg (2001)"},{"issue":"8","key":"33_CR9","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1089\/cmb.2006.13.1419","volume":"13","author":"M. Bonet","year":"2006","unstructured":"Bonet, M., John, R., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. J. Comput. Biol.\u00a013(8), 1419\u20131434 (2006)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"33_CR10","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.jda.2007.10.002","volume":"6","author":"M. Bordewich","year":"2008","unstructured":"Bordewich, M., McCartin, C., Semple, C.: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms\u00a06(3), 458\u2013471 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"1-3","key":"33_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2006.12.011","volume":"374","author":"E. Rodrigues","year":"2007","unstructured":"Rodrigues, E., Sagot, M., Wakabayashi, Y.: The maximum agreement forest problem: approximation algorithms and computational experiments. Theoretical Computer Science\u00a0374(1-3), 91\u2013110 (2007)","journal-title":"Theoretical Computer Science"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-04241-6_32","volume-title":"Algorithms in Bioinformatics","author":"C. Whidden","year":"2009","unstructured":"Whidden, C., Zeh, N.: A unifying view on approximation and FPT of agreement forests. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol.\u00a05724, pp. 390\u2013402. Springer, Heidelberg (2009)"},{"key":"33_CR13","unstructured":"Whidden, C., Beiko, R., Zeh, N.: Fixed-parameter and approximation algorithms for maximum agreement forests. CoRR. abs\/1108.2664 (2011)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-45043-3_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Chen","year":"2013","unstructured":"Chen, J., Fan, J.-H., Sze, S.-H.: Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol.\u00a08165, pp. 152\u2013164. Springer, Heidelberg (2013)"},{"key":"33_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ipl.2004.11.004","volume":"93","author":"F. Chataigner","year":"2005","unstructured":"Chataigner, F.: Approximating the maximum agreement forest on k trees. Information Processing Letters\u00a093, 239\u2013244 (2005)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:57:10Z","timestamp":1558940230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}