{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T13:29:33Z","timestamp":1747402173913},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_14","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T14:05:50Z","timestamp":1384265150000},"page":"152-164","source":"Crossref","is-referenced-by-count":3,"title":["Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees"],"prefix":"10.1007","author":[{"given":"Jianer","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Hao","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sing-Hoi","family":"Sze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","first-page":"2001","volume":"5","author":"B. Allen","year":"2000","unstructured":"Allen, B., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Comb.\u00a05, 2001 (2000)","journal-title":"Ann. Comb."},{"issue":"6","key":"14_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. Comput.\u00a026(6), 1656\u20131669 (1997)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"14_CR3","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, K., 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":"14_CR4","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 Alg.\u00a06(3), 458\u2013471 (2008)","journal-title":"J. Discrete Alg."},{"issue":"4","key":"14_CR5","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. Ann. Comb.\u00a08(4), 409\u2013423 (2005)","journal-title":"Ann. Comb."},{"issue":"5","key":"14_CR6","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. Inf. Process. Lett.\u00a093(5), 239\u2013244 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"2-3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/PL00008273","volume":"25","author":"B. DasGupta","year":"1999","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J.: On the linear-cost subtree-transfer distance between phylogenetic trees. Algorithmica\u00a025(2-3), 176\u2013195 (1999)","journal-title":"Algorithmica"},{"key":"14_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"key":"14_CR9","unstructured":"Farach, M., Thorup, M.: Fast comparison of evolutionary trees. In: SODA, pp. 481\u2013488 (1994)"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s00224-007-1329-z","volume":"41","author":"M. Hallett","year":"2007","unstructured":"Hallett, M., McCartin, C.: A faster FPT algorithm for the maximum agreement forest problem. Theory Comput. Syst.\u00a041(3), 539\u2013550 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"1-3","key":"14_CR11","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 Appl. Math.\u00a071(1-3), 153\u2013169 (1996)","journal-title":"Discrete Appl. Math."},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-48686-0_6","volume-title":"Computing and Combinatorics","author":"W.-K. Hon","year":"1999","unstructured":"Hon, W.-K., Lam, T.-W.: Approximating the nearest neighbor interchange distance for evolutionary trees with non-uniform degrees. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 61\u201370. Springer, Heidelberg (1999)"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/TCBB.2008.86","volume":"6","author":"S. Linz","year":"2009","unstructured":"Linz, S., Semple, C.: Hybridization in nonbinary trees. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a06, 30\u201345 (2009)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.) APPROX-RANDOM 2001. LNCS, vol.\u00a02129, pp. 159\u2013169. Springer, Heidelberg (2001)"},{"issue":"1-3","key":"14_CR15","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. Theor. Comput. Sci.\u00a0374(1-3), 91\u2013110 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR16","unstructured":"Whidden, C., Beiko, R., Zeh, N.: Fixed-parameter and approximation algorithms for maximum agreement forests. CoRR, abs\/1108.2664 (2011)"},{"key":"14_CR17","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)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45043-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T06:17:58Z","timestamp":1558678678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}