{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:53:00Z","timestamp":1725583980405},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_7","type":"book-chapter","created":{"date-parts":[[2013,5,20]],"date-time":"2013-05-20T20:43:48Z","timestamp":1369082628000},"page":"36-47","source":"Crossref","is-referenced-by-count":2,"title":["Faster Exact Computation of rSPR Distance"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"159","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, 159\u2013169 (2006)","journal-title":"BMC Evol. Biol."},{"key":"7_CR2","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., St. John, K., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. Journal of Computational Biology\u00a013, 1419\u20131434 (2006)","journal-title":"Journal of Computational Biology"},{"key":"7_CR3","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. Journal of Discrete Algorithms\u00a06, 458\u2013471 (2008)","journal-title":"Journal of Discrete Algorithms"},{"key":"7_CR4","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 Combinatorics\u00a08, 409\u2013423 (2005)","journal-title":"Annals of Combinatorics"},{"key":"7_CR5","doi-asserted-by":"publisher","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\u00a013, 155 (2012)","journal-title":"BMC Bioinformatics"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","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. Journal of Computational Biology\u00a020(1), 38\u201341 (2013)","journal-title":"Journal of Computational Biology"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1111\/j.1096-0031.2007.00189.x","volume":"24","author":"P.A. Goloboff","year":"2007","unstructured":"Goloboff, P.A.: Calculating SPR distances between trees. Cladistics\u00a024(4), 591\u2013597 (2007)","journal-title":"Cladistics"},{"key":"7_CR8","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., Jing, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Appl. Math.\u00a071, 153\u2013169 (1996)","journal-title":"Discrete Appl. Math."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1186\/1471-2148-10-42","volume":"10","author":"T. Hill","year":"2010","unstructured":"Hill, T., Nordstr\u00f6m, K.J., Thollesson, M., S\u00e4fstr\u00f6m, T.M., Vernersson, A.K., Fredriksson, R., Schi\u00f6th, H.B.: SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees. BMC Evolutionary Biology\u00a010, 42 (2010)","journal-title":"BMC Evolutionary Biology"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1186\/1471-2148-5-27","volume":"5","author":"D. MacLeod","year":"2005","unstructured":"MacLeod, D., Charlebois, R.L., Doolittle, F., Bapteste, E.: Deduction of probable events of lateral gene transfer through comparison of phylogenetic trees by recursive consolidation and rearrangement. BMC Evolutionary Biology\u00a05(1), 27 (2005)","journal-title":"BMC Evolutionary Biology"},{"key":"7_CR11","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. Theoretical Computer Science\u00a0374, 91\u2013110 (2007)","journal-title":"Theoretical Computer Science"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1186\/1471-2105-9-322","volume":"9","author":"C. Than","year":"2008","unstructured":"Than, C., Ruths, D., Nakhleh, L.: PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships. BMC Bioinformatics\u00a09, 322 (2008)","journal-title":"BMC Bioinformatics"},{"issue":"2","key":"7_CR13","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"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06049, pp. 141\u2013153. Springer, Heidelberg (2010)"},{"key":"7_CR15","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","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:30:44Z","timestamp":1557703844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}