{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T15:29:40Z","timestamp":1747322980131},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T00:00:00Z","timestamp":1434067200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10878-015-9921-7","type":"journal-article","created":{"date-parts":[[2015,6,11]],"date-time":"2015-06-11T14:11:07Z","timestamp":1434031867000},"page":"111-143","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees"],"prefix":"10.1007","volume":"32","author":[{"given":"Feng","family":"Shi","sequence":"first","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jie","family":"You","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,12]]},"reference":[{"issue":"1","key":"9921_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B Allen","year":"2001","unstructured":"Allen B, Steel M (2001) Subtree transfer operations and their induced metrics on evolutionary trees. Ann Comb 5(1):1\u201315","journal-title":"Ann Comb"},{"issue":"2","key":"9921_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00285-005-0315-9","volume":"51","author":"M Baroni","year":"2005","unstructured":"Baroni M, Grnewald S, Moulton V, Semple C (2005) Bounding the number of hybridisation events for a consistent evolutionary history. J Math Biol 51(2):171\u2013182","journal-title":"J Math Biol"},{"issue":"8","key":"9921_CR3","doi-asserted-by":"crossref","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 (2006) Approximating subtree distances between phylogenies. J Comput Biol 13(8):1419\u20131434","journal-title":"J Comput Biol"},{"issue":"3","key":"9921_CR4","doi-asserted-by":"crossref","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 (2008) A 3-approximation algorithm for the subtree distance between phylogenies. J Discret Algorithms 6(3):458\u2013471","journal-title":"J Discret Algorithms"},{"issue":"4","key":"9921_CR5","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M Bordewich","year":"2005","unstructured":"Bordewich M, Semple C (2005) On the computational complexity of the rooted subtree prune and regraft distance. Ann Comb 8(4):409\u2013423","journal-title":"Ann Comb"},{"key":"9921_CR6","first-page":"387","volume-title":"Mathematics in the archaeological and historical sciences","author":"P Buneman","year":"1971","unstructured":"Buneman P (1971) The recovery of trees from measures of dissimilarity. In: Hodson F, Kendall D, Tauta P (eds) Mathematics in the archaeological and historical sciences. Edinburgh University Press, Edinburgh, pp 387\u2013395"},{"key":"9921_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.ipl.2004.11.004","volume":"93","author":"F Chataigner","year":"2005","unstructured":"Chataigner F (2005) Approximating the maximum agreement forest on $$k$$ k trees. Inf Process Lett 93:239\u2013244","journal-title":"Inf Process Lett"},{"issue":"1","key":"9921_CR8","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1093\/molbev\/msu287","volume":"32","author":"G Dudas","year":"2015","unstructured":"Dudas G, Bedford T, Lycett S et al (2015) Reassortment between influenza B lineages and the emergence of a coadapted PB1-PB2-HA gene complex. Mol Biol Evol 32(1):162\u2013172","journal-title":"Mol Biol Evol"},{"key":"9921_CR9","doi-asserted-by":"crossref","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 (1996) On the complexity of comparing evolutionary trees. Discret Appl Math 71:153\u2013169","journal-title":"Discret Appl Math"},{"issue":"3","key":"9921_CR10","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s00224-007-1329-z","volume":"41","author":"M Hallett","year":"2007","unstructured":"Hallett M, McCartin C (2007) A faster FPT algorithm for the maximum agreement forest problem. Theory Comput Syst 41(3):539\u2013550","journal-title":"Theory Comput Syst"},{"issue":"1","key":"9921_CR11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/120903567","volume":"28","author":"LV Lersel","year":"2014","unstructured":"Lersel LV, Kelk S, Lekic N, Stougie L (2014) Approximation algorithms for nonbinary agreement forests. SIAM J Discret Math 28(1):49\u201366","journal-title":"SIAM J Discret Math"},{"issue":"4","key":"9921_CR12","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1006\/jtbi.1996.0188","volume":"182","author":"M Li","year":"1996","unstructured":"Li M, Tromp J, Zhang L (1996) On the nearest neighbour interchange distance between evolutionary trees. J Theor Biol 182(4):463\u2013467","journal-title":"J Theor Biol"},{"issue":"1\u20132","key":"9921_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D Robinson","year":"1981","unstructured":"Robinson D, Foulds L (1981) Comparison of phylogenetic trees. Math Biosci 53(1\u20132):131\u2013147","journal-title":"Math Biosci"},{"issue":"1\u20133","key":"9921_CR14","doi-asserted-by":"crossref","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 (2007) The maximum agreement forest problem: approximation algorithms and computational experiments. Theor Comput Sci 374(1\u20133):91\u2013110","journal-title":"Theor Comput Sci"},{"key":"9921_CR15","unstructured":"Rodrigues M, Sagot M, Wakabayashi Y (2001) Some approxiamtion results for the maximum agreement forest problem. In: Proceedings of RANDOM 2001 and APPROX 2001, LNCS, vol 2129, pp 159\u2013169"},{"key":"9921_CR16","unstructured":"Swofford D, Olsen G, Waddell P, Hillis D (1996) Phylogenetic inference. In: Molecular Systematics, 2nd edn. Sinauer, Associates, pp 407\u2013513"},{"key":"9921_CR17","doi-asserted-by":"crossref","unstructured":"Shi F, Chen J, Feng Q, Wang J (2014) Approximation algorithms for maximum agreement forest on multiple trees. In: Proceedings of 20th international computing and combinatorics conference, LNCS, vol 8591, pp 381\u2013392","DOI":"10.1007\/978-3-319-08783-2_33"},{"key":"9921_CR18","unstructured":"Whidden C, Beiko R, Zeh N (2011) Fixed-parameter and approximation algorithms for maximum agreement forests. CoRR. abs\/1108.2664"},{"key":"9921_CR19","unstructured":"Whidden C, Beiko R, Zeh N (2013) Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees. arXiv preprint arXiv:1305.0512"},{"key":"9921_CR20","doi-asserted-by":"crossref","unstructured":"Whidden C, Zeh N (2009) A unifying view on approximation and FPT of agreement forests. In: Proceedings of the 9th workshop on algorithms in bioinformatics, LNCS, vol 5724, pp 390\u2013401","DOI":"10.1007\/978-3-642-04241-6_32"},{"issue":"4","key":"9921_CR21","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1137\/110845045","volume":"42","author":"C Whidden","year":"2013","unstructured":"Whidden C, Beiko R, Zeh N (2013) Fixed-parameter algorithms for maximum agreement forests. SIAM J Comput 42(4):1431\u20131466","journal-title":"SIAM J Comput"},{"issue":"4","key":"9921_CR22","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1093\/sysbio\/syu023","volume":"63","author":"C Whidden","year":"2014","unstructured":"Whidden C, Zeh N, Beiko R (2014) Supertrees based on the subtree prune-and-regraft distance. Syst Biol 63(4):566\u2013581. doi: 10.1093\/sysbio\/syu023","journal-title":"Syst Biol"},{"key":"9921_CR23","doi-asserted-by":"publisher","unstructured":"Whidden C, Frederick A, Matsen I (2015) Quantifying MCMC exploration of phylogenetic tree space. Syst Biol. doi: 10.1093\/sysbio\/syv006","DOI":"10.1093\/sysbio\/syv006"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9921-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9921-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9921-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:27Z","timestamp":1559276607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9921-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9921"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9921-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,12]]}}}