{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:09:15Z","timestamp":1773274155992,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319426334","type":"print"},{"value":"9783319426341","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_38","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T15:50:21Z","timestamp":1468943421000},"page":"468-479","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Approximation Algorithm for rSPR Distance"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Eita","family":"Machida","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s00285-005-0315-9","volume":"51","author":"M Baroni","year":"2005","unstructured":"Baroni, M., Grunewald, S., Moulton, V., Semple, C.: Bounding the number of hybridisation events for a consistent evolutionary history. J. Math. Biol. 51, 171\u2013182 (2005)","journal-title":"J. Math. Biol."},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"159","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, 159\u2013169 (2006)","journal-title":"BMC Evol. Biol."},{"key":"38_CR3","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., John, K.S., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. J. Comput. Biol. 13, 1419\u20131434 (2006)","journal-title":"J. Comput. Biol."},{"key":"38_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.: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6, 458\u2013471 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"38_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.: On the computational complexity of the rooted subtree prune and regraft distance. Ann. Comb. 8, 409\u2013423 (2005)","journal-title":"Ann. Comb."},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1186\/1471-2105-13-155","volume":"13","author":"Z-Z Chen","year":"2012","unstructured":"Chen, Z.-Z., Wang, L.: FastHN: a fast tool for minimum hybridization networks. BMC Bioinformatics 13, 155 (2012)","journal-title":"BMC Bioinformatics"},{"issue":"3","key":"38_CR7","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s10878-013-9695-8","volume":"29","author":"Z-Z Chen","year":"2015","unstructured":"Chen, Z.-Z., Fan, Y., Wang, L.: Faster exact computation of rSPR distance. J. Comb. Optim. 29(3), 605\u2013635 (2015)","journal-title":"J. Comb. Optim."},{"key":"38_CR8","doi-asserted-by":"publisher","unstructured":"Shi, F., Feng, Q., You, J., Wang, J.: Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees. J. Comb. Optim (to appear). doi: 10.1007\/s10878-015-9921-7","DOI":"10.1007\/s10878-015-9921-7"},{"key":"38_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., Jing, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71, 153\u2013169 (1996)","journal-title":"Discrete Appl. Math."},{"key":"38_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1009837726913","volume":"3","author":"B Ma","year":"1999","unstructured":"Ma, B., Wang, L., Zhang, L.: Fitting distances by tree metrics with increment error. J. Comb. Optim. 3, 213\u2013225 (1999)","journal-title":"J. Comb. Optim."},{"key":"38_CR11","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1093\/sysbio\/46.3.523","volume":"46","author":"WP Maddison","year":"1997","unstructured":"Maddison, W.P.: Gene trees in species trees. Syst. Biol. 46, 523\u2013536 (1997)","journal-title":"Syst. Biol."},{"key":"38_CR12","doi-asserted-by":"crossref","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, L.S.: Reconstructing reticulate evolution in species - theory and practice. J. Comput. Biol. 12, 796\u2013811 (2005)","journal-title":"J. Comput. Biol."},{"key":"38_CR13","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. Theoret. Comput. Sci. 374, 91\u2013110 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"38_CR14","doi-asserted-by":"crossref","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 25(2), 190\u2013196 (2009)","journal-title":"Bioinformatics"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-13193-6_13","volume-title":"Experimental Algorithms","author":"C Whidden","year":"2010","unstructured":"Whidden, C., Beiko, R.G., Zeh, N.: Fast FPT algorithms for computing rooted agreement forests: theory and experiments. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 141\u2013153. Springer, Heidelberg (2010)"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 5724, pp. 390\u2013402. Springer, Heidelberg (2009)"}],"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-42634-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:44:19Z","timestamp":1498329859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}