{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:05:07Z","timestamp":1743030307654,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319595740"},{"type":"electronic","value":"9783319595757"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59575-7_12","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:14:49Z","timestamp":1496135689000},"page":"128-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A New 2-Approximation Algorithm for rSPR Distance"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Youta","family":"Harada","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"12_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., 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":"12_CR2","doi-asserted-by":"publisher","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":"12_CR3","doi-asserted-by":"publisher","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":"12_CR4","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. Discrete Algorithms 6, 458\u2013471 (2008)","journal-title":"J. Discrete Algorithms"},{"key":"12_CR5","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. Ann. Comb. 8, 409\u2013423 (2005)","journal-title":"Ann. Comb."},{"key":"12_CR6","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 Bioinform. 13, 155 (2012)","journal-title":"BMC Bioinform."},{"issue":"1","key":"12_CR7","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. J. Comput. Biol. 20(1), 38\u201341 (2013)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","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":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-319-42634-1_38","volume-title":"Computing and Combinatorics","author":"Z-Z Chen","year":"2016","unstructured":"Chen, Z.-Z., Machida, E., Wang, L.: An improved approximation algorithm for rSPR distance. In: Dinh, T.N., Thai, M.T. (eds.) COCOON 2016. LNCS, vol. 9797, pp. 468\u2013479. Springer, Cham (2016). doi:10.1007\/978-3-319-42634-1_38"},{"doi-asserted-by":"crossref","unstructured":"Chen, Z.-Z., Machida, E., Wang, L.: A Cubic-Time Approximation Algorithm for rSPR Distance. CoRR, abs\/1609.04029, 2016 (2016)","key":"12_CR10","DOI":"10.1007\/978-3-319-42634-1_38"},{"doi-asserted-by":"crossref","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. (2014, to appear)","key":"12_CR11","DOI":"10.1007\/s10878-015-9921-7"},{"key":"12_CR12","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. 71, 153\u2013169 (1996)","journal-title":"Discrete Appl. Math."},{"key":"12_CR13","doi-asserted-by":"publisher","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":"12_CR14","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10878-009-9261-6","volume":"21","author":"B Ma","year":"2011","unstructured":"Ma, B., Zhang, L.: Efficient estimation of the accuracy of the maximum likelihood method for ancestral state reconstruction. J. Comb. Optim. 21, 409\u2013422 (2011)","journal-title":"J. Comb. Optim."},{"key":"12_CR15","doi-asserted-by":"publisher","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":"12_CR16","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, L.S.: Reconstructing reticulate evolution in species - theory and practice. J. Comput. Biol. 12, 796\u2013811 (2005)","journal-title":"J. Comput. Biol."},{"key":"12_CR17","doi-asserted-by":"publisher","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, 91\u2013110 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u201370","key":"12_CR18","first-page":"14","volume":"70","author":"F Schalekamp","year":"2016","unstructured":"Schalekamp, F., van Zuylen, A., van der Ster, S.: A duality based 2-approximation algorithm for maximum agreement forest. Proc. ICALP 70(1\u201370), 14 (2016)","journal-title":"Proc. ICALP"},{"issue":"2","key":"12_CR19","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 25(2), 190\u2013196 (2009)","journal-title":"Bioinformatics"},{"key":"12_CR20","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. 6049, pp. 141\u2013153. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13193-6_13"},{"key":"12_CR21","first-page":"390","volume":"5724","author":"C Whidden","year":"2009","unstructured":"Whidden, C., Zeh, N.: A unifying view on approximation and FPT of agreement forests. LNCS 5724, 390\u2013401 (2009)","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59575-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:47:47Z","timestamp":1709822867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59575-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319595740","9783319595757"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59575-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"31 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISBRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Bioinformatics Research and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Honolulu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/alan.cs.gsu.edu\/isbra17\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}