{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T15:56:00Z","timestamp":1719071760291},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,21]],"date-time":"2015-03-21T00:00:00Z","timestamp":1426896000000},"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":["Algorithmica"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s00453-015-9983-z","type":"journal-article","created":{"date-parts":[[2015,3,20]],"date-time":"2015-03-20T17:11:39Z","timestamp":1426871499000},"page":"1019-1054","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests of Multifurcating Trees"],"prefix":"10.1007","volume":"74","author":[{"given":"Chris","family":"Whidden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert G.","family":"Beiko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,21]]},"reference":[{"issue":"2","key":"9983_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1093\/bioinformatics\/btr618","volume":"28","author":"B Albrecht","year":"2012","unstructured":"Albrecht, B., Scornavacca, C., Cenci, A., Huson, D.H.: Fast computation of minimum hybridization networks. Bioinformatics 28(2), 191\u2013197 (2012)","journal-title":"Bioinformatics"},{"issue":"1","key":"9983_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"BL Allen","year":"2001","unstructured":"Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Comb. 5(1), 1\u201315 (2001)","journal-title":"Ann. Comb."},{"issue":"2","key":"9983_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00285-005-0315-9","volume":"51","author":"M Baroni","year":"2005","unstructured":"Baroni, M., Gr\u00fcnewald, S., Moulton, V., Semple, C.: Bounding the number of hybridisation events for a consistent evolutionary history. J. Math. Biol. 51(2), 171\u2013182 (2005)","journal-title":"J. Math. Biol."},{"issue":"1","key":"9983_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1186\/1471-2148-6-15","volume":"6","author":"RG Beiko","year":"2006","unstructured":"Beiko, R.G., Hamilton, N.: Phylogenetic identification of lateral genetic transfer events. BMC Evol. Biol. 6(1), 15 (2006)","journal-title":"BMC Evol. Biol."},{"issue":"8","key":"9983_CR5","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1089\/cmb.2006.13.1419","volume":"13","author":"ML Bonet","year":"2006","unstructured":"Bonet, M.L., St. John, K., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. J. Comput. Biol. 13(8), 1419\u20131434 (2006)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"9983_CR6","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.: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discret. Algorithms 6(3), 458\u2013471 (2008)","journal-title":"J. Discret. Algorithms"},{"issue":"4","key":"9983_CR7","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.: On the computational complexity of the rooted subtree prune and regraft distance. Ann. Combin. 8(4), 409\u2013423 (2005)","journal-title":"Ann. Combin."},{"issue":"8","key":"9983_CR8","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1016\/j.dam.2006.08.008","volume":"155","author":"M Bordewich","year":"2007","unstructured":"Bordewich, M., Semple, C.: Computing the minimum number of hybridization events for a consistent evolutionary history. Discret. Appl. Math. 155(8), 914\u2013928 (2007)","journal-title":"Discret. Appl. Math."},{"issue":"22","key":"9983_CR9","doi-asserted-by":"crossref","first-page":"2912","DOI":"10.1093\/bioinformatics\/btq548","volume":"26","author":"Z-Z Chen","year":"2010","unstructured":"Chen, Z.-Z., Wang, L.: Hybridnet: a tool for constructing hybridization networks. Bioinformatics 26(22), 2912\u20132913 (2010)","journal-title":"Bioinformatics"},{"key":"9983_CR10","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/TCBB.2011.137","volume":"9","author":"Z-Z Chen","year":"2012","unstructured":"Chen, Z.-Z., Wang, L.: Algorithms for reticulate networks of multiple phylogenetic trees. IEEE\/ACM Trans. Comput. Biol. Bioinform. 9, 372\u2013384 (2012)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"9983_CR11","doi-asserted-by":"crossref","unstructured":"Chen, Z.-Z., Wang, L.: Faster exact computation of rSPR distance. In: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, pp. 36\u201347. Springer (2013)","DOI":"10.1007\/978-3-642-38756-2_7"},{"issue":"1","key":"9983_CR12","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1089\/cmb.2012.0240","volume":"20","author":"Z-Z Chen","year":"2013","unstructured":"Chen, Z.-Z., Wang, L.: An ultrafast tool for minimum reticulate networks. J. Comput. Biol. 20(1), 38\u201341 (2013)","journal-title":"J. Comput. Biol."},{"key":"9983_CR13","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. McGraw-Hill, New York (2001)","edition":"2"},{"issue":"1\u20133","key":"9983_CR14","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.: On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71(1\u20133), 153\u2013169 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9983_CR15","first-page":"17","volume":"4","author":"G Hickey","year":"2008","unstructured":"Hickey, G., Dehne, F., Rau-Chaplin, A., Blouin, C.: SPR distance computation for unrooted trees. Evolut. Bioinform. 4, 17\u201327 (2008)","journal-title":"Evolut. Bioinform."},{"key":"9983_CR16","volume-title":"Molecular Systematics","year":"1996","unstructured":"Hillis, D.M., Moritz, C., Mable, B.K. (eds.): Molecular Systematics. Sinauer Associates, Sunderland (1996)"},{"issue":"1","key":"9983_CR17","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/120903567","volume":"28","author":"L Iersel van","year":"2014","unstructured":"van Iersel, L., Kelk, S., Leki\u0107, N., Stougie, L.: Computing nonbinary agreement forests. SIAM J. Discret. Math. 28(1), 49\u201366 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"9983_CR18","doi-asserted-by":"crossref","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 Trans. Comput. Biol. Bioinform. 6, 30\u201345 (2009)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"4","key":"9983_CR19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1111\/j.1096-0031.1989.tb00569.x","volume":"5","author":"W Maddison","year":"1989","unstructured":"Maddison, W.: Reconstructing character evolution on polytomous cladograms. Cladistics 5(4), 365\u2013377 (1989)","journal-title":"Cladistics"},{"issue":"1\u20133","key":"9983_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.tcs.2006.12.011","volume":"374","author":"EM Rodrigues","year":"2007","unstructured":"Rodrigues, E.M., Sagot, M.-F., Wakabayashi, Y.: The maximum agreement forest problem: approximation algorithms and computational experiments. Theor. Comput. Sci. 374(1\u20133), 91\u2013110 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"9983_CR21","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1093\/molbev\/msj120","volume":"23","author":"V Rosas-Magallanes","year":"2006","unstructured":"Rosas-Magallanes, V., Deschavanne, P., Quintana-Murci, L., Brosch, R., Gicquel, B., Neyrolles, O.: Horizontal transfer of a virulence operon to the ancestor of mycobacterium tuberculosis. Mol. Biol. Evol. 23(6), 1129\u20131135 (2006)","journal-title":"Mol. Biol. Evol."},{"key":"9983_CR22","unstructured":"Whidden, C.: RSPR software. http:\/\/kiwi.cs.dal.ca\/Software\/RSPR"},{"key":"9983_CR23","unstructured":"Whidden, C.: SPRSupertrees software. http:\/\/kiwi.cs.dal.ca\/Software\/SPRSupertrees"},{"key":"9983_CR24","doi-asserted-by":"crossref","unstructured":"Whidden, C., Beiko, R.G., Zeh, N.: Fast FPT algorithms for computing rooted agreement forests: theory and experiments. In: Proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010, vol. 6049 of Lecture Notes in Computer Science, pp. 141\u2013153. Springer (2010)","DOI":"10.1007\/978-3-642-13193-6_13"},{"issue":"4","key":"9983_CR25","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1137\/110845045","volume":"42","author":"C Whidden","year":"2013","unstructured":"Whidden, C., Beiko, R.G., Zeh, N.: Fixed-parameter algorithms for maximum agreement forests. SIAM J. Comput. 42(4), 1431\u20131466 (2013)","journal-title":"SIAM J. Comput."},{"key":"9983_CR26","doi-asserted-by":"crossref","unstructured":"Whidden, C., Zeh, N.: A unifying view on approximation and FPT of agreement forests. In: Proceedings of the 9th International Workshop, WABI 2009, volume 5724 of Lecture Notes in Bioinformatics, pp. 390\u2013401. Springer (2009)","DOI":"10.1007\/978-3-642-04241-6_32"},{"issue":"4","key":"9983_CR27","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1093\/sysbio\/syu023","volume":"63","author":"C Whidden","year":"2014","unstructured":"Whidden, C., Zeh, N., Beiko, R.G.: Supertrees based on the subtree prune-and-regraft distance. Syst. Biol. 63(4), 566\u2013581 (2014)","journal-title":"Syst. Biol."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9983-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-9983-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-9983-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:47:23Z","timestamp":1559087243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-9983-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,21]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["9983"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-9983-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,21]]}}}