{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:09:40Z","timestamp":1773274180693,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642131929","type":"print"},{"value":"9783642131936","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_13","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"141-153","source":"Crossref","is-referenced-by-count":24,"title":["Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments"],"prefix":"10.1007","author":[{"given":"Chris","family":"Whidden","sequence":"first","affiliation":[]},{"given":"Robert G.","family":"Beiko","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Zeh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","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.\u00a051(2), 171\u2013182 (2005)","journal-title":"J. Math. Biol."},{"issue":"40","key":"13_CR2","doi-asserted-by":"publisher","first-page":"14332","DOI":"10.1073\/pnas.0504068102","volume":"102","author":"R.G. Beiko","year":"2005","unstructured":"Beiko, R.G., Harlow, T.J., Ragan, M.A.: Highways of gene sharing in prokaryotes. P. Natl. Acad. Sci. USA\u00a0102(40), 14332\u201314337 (2005)","journal-title":"P. Natl. Acad. Sci. USA"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1186\/1471-2148-6-15","volume":"6","author":"R.G. Beiko","year":"2006","unstructured":"Beiko, R.G., Hamilton, N.: Phylogenetic identification of lateral genetic transfer events. BMC Evol. Biol.\u00a06(1), 15 (2006)","journal-title":"BMC Evol. Biol."},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-02777-2_3","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"M.L. Bonet","year":"2009","unstructured":"Bonet, M.L., John, K.S.: Efficiently Calculating Evolutionary Tree Measures Using SAT. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 4\u201317. Springer, Heidelberg (2009)"},{"issue":"8","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1089\/cmb.2006.13.1419","volume":"13","author":"M.L. Bonet","year":"2006","unstructured":"Bonet, M.L., John, K.S., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. J. Comp. Biol.\u00a013(8), 1419\u20131434 (2006)","journal-title":"J. Comp. Biol."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1177\/117693430700300017","volume":"3","author":"M. Bordewich","year":"2007","unstructured":"Bordewich, M., Linz, S., John, K.S., Semple, C.: A reduction algorithm for computing the hybridization number of two trees. Evol. Bioinform.\u00a03, 86\u201398 (2007)","journal-title":"Evol. Bioinform."},{"issue":"3","key":"13_CR7","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. Disc. Alg.\u00a06(3), 458\u2013471 (2008)","journal-title":"J. Disc. Alg."},{"issue":"4","key":"13_CR8","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 Comb.\u00a08(4), 409\u2013423 (2005)","journal-title":"Annals of Comb."},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1109\/tcbb.2007.1019","volume":"4","author":"M. Bordewich","year":"2007","unstructured":"Bordewich, M., Semple, C.: Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable. IEEE\/ACM T. Comp. Biol.\u00a04(3), 458\u2013466 (2007)","journal-title":"IEEE\/ACM T. Comp. Biol."},{"issue":"8","key":"13_CR10","doi-asserted-by":"publisher","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. Disc. Appl. Math.\u00a0155(8), 914\u2013928 (2007)","journal-title":"Disc. Appl. Math."},{"issue":"1-3","key":"13_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. Disc. Appl. Math.\u00a071(1-3), 153\u2013169 (1996)","journal-title":"Disc. Appl. Math."},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"17","DOI":"10.4137\/EBO.S419","volume":"4","author":"G. Hickey","year":"2008","unstructured":"Hickey, G., Dehne, F., Rau-Chaplin, A., Blouin, C.: SPR distance computation for unrooted trees. Evol. Bioinform.\u00a04, 17\u201327 (2008)","journal-title":"Evol. Bioinform."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Hillis, D.M., Moritz, C., Mable, B.K. (eds.): Molecular Systematics. Sinauer Associates (1996)","DOI":"10.2307\/1447682"},{"issue":"3","key":"13_CR14","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1093\/sysbio\/46.3.523","volume":"46","author":"W.P. Maddison","year":"1997","unstructured":"Maddison, W.P.: Gene trees in species trees. Syst. Biol.\u00a046(3), 523\u2013536 (1997)","journal-title":"Syst. Biol."},{"issue":"6","key":"13_CR15","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1089\/cmb.2005.12.796","volume":"12","author":"L. Nakhleh","year":"2005","unstructured":"Nakhleh, L., Warnow, T., Lindner, C.R., John, K.S.: Reconstructing reticulate evolution in species\u2014theory and practice. J. Comp. Biol.\u00a012(6), 796\u2013811 (2005)","journal-title":"J. Comp. Biol."},{"issue":"1-3","key":"13_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2006.12.011","volume":"374","author":"E.M. Rodrigues","year":"2007","unstructured":"Rodrigues, E.M., Sagot, M.F., Wakabayashi, Y.: The maximum agreement forest problem: Approximation algorithms and computational experiments. Theor. Comp. Sci.\u00a0374(1-3), 91\u2013110 (2007)","journal-title":"Theor. Comp. Sci."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Whidden, C., Beiko, R.G., Zeh, N.: Fast FPT algorithms for computing rooted agreement forests: Theory and experiments. Tech. Rep. CS-2010-03, Faculty of Computer Science, Dalhousie University (2010)","DOI":"10.1007\/978-3-642-13193-6_13"},{"key":"13_CR18","series-title":"LNCS(LNBI)","first-page":"390","volume-title":"WABI 2009","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(LNBI), vol.\u00a05724, pp. 390\u2013401. Springer, Heidelberg (2009)"},{"key":"13_CR19","unstructured":"Whidden, C.: rSPR FPT Software, http:\/\/kiwi.cs.dal.ca\/Software\/RSPR"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1093\/bioinformatics\/btn606","volume":"25","author":"Y. Wu","year":"2009","unstructured":"Wu, Y.: A practical method for exact computation of subtree prune and regraft distance. Bioinformatics\u00a025(2), 190\u2013196 (2009)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:31Z","timestamp":1606186951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}