{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:51:37Z","timestamp":1774435897083,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,12,8]],"date-time":"2013-12-08T00:00:00Z","timestamp":1386460800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10878-013-9695-8","type":"journal-article","created":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T10:04:58Z","timestamp":1386410698000},"page":"605-635","source":"Crossref","is-referenced-by-count":11,"title":["Faster exact computation of rSPR distance"],"prefix":"10.1007","volume":"29","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ying","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,8]]},"reference":[{"key":"9695_CR1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1186\/1471-2148-6-15","volume":"6","author":"RG Beiko","year":"2006","unstructured":"Beiko RG, Hamilton N (2006) Phylogenetic identification of lateral genetic transfer events. BMC Evol Biol 6:159\u2013169","journal-title":"BMC Evol Biol"},{"key":"9695_CR2","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1089\/cmb.2006.13.1419","volume":"13","author":"ML Bonet","year":"2006","unstructured":"Bonet ML, John KSt, Mahindru R, Amenta N (2006) Approximating subtree distances between phylogenies. J Comput Biol 13:1419\u20131434","journal-title":"J Comput Biol"},{"key":"9695_CR3","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:458\u2013471","journal-title":"J Discret Algorithms"},{"key":"9695_CR4","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 Combinatorics 8:409\u2013423","journal-title":"Ann Combinatorics"},{"key":"9695_CR5","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 (2012) FastHN: a fast tool for minimum hybridization networks. BMC Bioinform 13:155","journal-title":"BMC Bioinform"},{"issue":"1","key":"9695_CR6","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 (2013) An ultrafast tool for minimum reticulate networks. J Comput Biol 20(1):38\u201341","journal-title":"J Comput Biol"},{"key":"9695_CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/A:1009833626004","volume":"3","author":"L Gasieniec","year":"1999","unstructured":"Gasieniec L, Jansson J, Lingas A, \u00d6stlin A (1999) On the complexity of constructing evolutionary trees. J Comb Optim 3:183\u2013197","journal-title":"J Comb Optim"},{"issue":"4","key":"9695_CR8","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1111\/j.1096-0031.2007.00189.x","volume":"24","author":"PA Goloboff","year":"2007","unstructured":"Goloboff PA (2007) Calculating SPR distances between trees. Cladistics 24(4):591\u2013597","journal-title":"Cladistics"},{"key":"9695_CR9","doi-asserted-by":"crossref","unstructured":"Grass Phylogeny Working Group (2001) Phylogeny and subfamilial classification of the grasses (poaceae). Ann Mo Bot Gard 88:373\u2013457","DOI":"10.2307\/3298585"},{"key":"9695_CR10","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 (1996) On the complexity of comparing evolutionary trees. Discret Appl Math 71:153\u2013169","journal-title":"Discret Appl Math"},{"key":"9695_CR11","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1186\/1471-2148-10-42","volume":"10","author":"T Hill","year":"2010","unstructured":"Hill T, Nordstr\u00f6m KJ, Thollesson M, S\u00e4fstr\u00f6m TM, Vernersson AK, Fredriksson R, Schi\u00f6th HB (2010) SPRIT: identifying horizontal gene transfer in rooted phylogenetic trees. BMC Evolut Biol 10:42","journal-title":"BMC Evolut Biol"},{"key":"9695_CR12","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 (1999) Fitting distances by tree metrics with increment error. J Comb Optim 3:213\u2013225","journal-title":"J Comb Optim"},{"key":"9695_CR13","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10878-009-9261-6","volume":"21","author":"B Ma","year":"2011","unstructured":"Ma B, Zhang L (2011) Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction. J Comb Optim 21:409\u2013422","journal-title":"J Comb Optim"},{"issue":"1","key":"9695_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1186\/1471-2148-5-27","volume":"5","author":"D MacLeod","year":"2005","unstructured":"MacLeod D, Charlebois RL, Doolittle F, Bapteste E (2005) Deduction of probable events of lateral gene transfer through comparison of phylogenetic trees by recursive consolidation and rearrangement. BMC Evolut Biol 5(1):27","journal-title":"BMC Evolut Biol"},{"key":"9695_CR15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.tcs.2006.12.011","volume":"374","author":"EM Rodrigues","year":"2007","unstructured":"Rodrigues EM, Sagot M-F, Wakabayashi Y (2007) The maximum agreement forest problem: approximation algorithms and computational experiments. Theor Comput Sci 374:91\u2013110","journal-title":"Theor Comput Sci"},{"key":"9695_CR16","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1186\/1471-2105-9-322","volume":"9","author":"C Than","year":"2008","unstructured":"Than C, Ruths D, Nakhleh L (2008) PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships. BMC Bioinform 9:322","journal-title":"BMC Bioinform"},{"issue":"2","key":"9695_CR17","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1093\/bioinformatics\/btn606","volume":"25","author":"Y Wu","year":"2009","unstructured":"Wu Y (2009) A practical method for exact computation of subtree prune and regraft distance. Bioinformatics 25(2):190\u2013196","journal-title":"Bioinformatics"},{"key":"9695_CR18","first-page":"141","volume":"6049","author":"C Whidden","year":"2010","unstructured":"Whidden C, Beiko RG, Zeh N (2010) Fast FPT algorithms for computing rooted agreement forest: theory and experiments. LNCS 6049:141\u2013153","journal-title":"LNCS"},{"key":"9695_CR19","first-page":"390","volume":"5724","author":"C Whidden","year":"2009","unstructured":"Whidden C, Zeh N (2009) A unifying view on approximation and FPT of agreement forests. LNCS 5724:390\u2013401","journal-title":"LNCS"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9695-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9695-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9695-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:22Z","timestamp":1559276602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9695-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,8]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9695"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9695-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,8]]}}}