{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:19Z","timestamp":1759637659869,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319784540"},{"type":"electronic","value":"9783319784557"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-78455-7_8","type":"book-chapter","created":{"date-parts":[[2018,3,20]],"date-time":"2018-03-20T08:53:10Z","timestamp":1521535990000},"page":"99-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Algorithms for Minimum Tree Cut\/Paste Distance and Minimum Common Integer Partition"],"prefix":"10.1007","author":[{"given":"Jie","family":"You","sequence":"first","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qilong","family":"Feng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,21]]},"reference":[{"key":"8_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Bulteau, L., Komusiewicz, C.: Minimum common string partition parameterized by partition size is fixed-parameter tractable. In: Chekuri, C. (ed.) Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 102\u2013121. SIAM (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.8","DOI":"10.1137\/1.9781611973402.8"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Chen, X., Liu, L., Liu, Z., Jiang, T.: On the minimum common integer partition problem. ACM Trans. Algorithms, 5(1), article no, 12 (2008). https:\/\/doi.org\/10.1145\/1435375.1435387","DOI":"10.1145\/1435375.1435387"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TCBB.2005.48","volume":"2","author":"X Chen","year":"2005","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE\/ACM Trans. Comput. Biol. Bioinform. 2(4), 302\u2013315 (2005). https:\/\/doi.org\/10.1145\/1100863.1100950","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-87361-7_8","volume-title":"Algorithms in Bioinformatics","author":"P Damaschke","year":"2008","unstructured":"Damaschke, P.: Minimum common string partition parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS, vol. 5251, pp. 87\u201398. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87361-7_8"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/978-1-4419-7997-1_52","volume-title":"Handbook of Combinatorial Optimization","author":"B DasGupta","year":"2013","unstructured":"DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., Wang, L., Zhang, L.: Computing distances between evolutionary trees. In: Pardalos, P.M., Du, D.-Z., Graham, R.L. (eds.) Handbook of Combinatorial Optimization, pp. 747\u2013781. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4419-7997-1_52"},{"key":"8_CR7","series-title":"Undergraduate Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Undergraduate Texts in Computer Science. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"CR Finden","year":"1985","unstructured":"Finden, C.R., Gordon, A.D.: Obtaining common pruned trees. J. Classif. 2(1), 255\u2013276 (1985)","journal-title":"J. Classif."},{"issue":"9","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1089\/cmb.2007.0048","volume":"14","author":"F Zheng","year":"2007","unstructured":"Zheng, F., Chen, X., Vacic, V., Nan, P., Zhong, Y., Jiang, T.: MSOAR: a high-throughput ortholog assignment system based on genome rearrangement. J. Comput. Biol. 14(9), 1160\u20131175 (2007). https:\/\/doi.org\/10.1089\/cmb.2007.0048. A preliminary version appeared in RECOMB 2006","journal-title":"J. Comput. Biol."},{"issue":"4","key":"8_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10878-010-9370-2","volume":"23","author":"H Jiang","year":"2012","unstructured":"Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. J. Comb. Optim. 23(4), 519\u2013527 (2012). https:\/\/doi.org\/10.1007\/s10878-010-9370-2","journal-title":"J. Comb. Optim."},{"issue":"9","key":"8_CR11","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1089\/cmb.2011.0254","volume":"19","author":"B Kirkpatrick","year":"2012","unstructured":"Kirkpatrick, B., Reshef, Y., Finucane, H., Jiang, H., Zhu, B., Karp, R.M.: Comparing pedigree graphs. J. Comput. Biol. 19(9), 998\u20131014 (2012). https:\/\/doi.org\/10.1089\/cmb.2011.0254","journal-title":"J. Comput. Biol."},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"K-C Tai","year":"1979","unstructured":"Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26(3), 422\u2013433 (1979). https:\/\/doi.org\/10.1145\/322139.322143","journal-title":"J. ACM"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-319-13075-0_28","volume-title":"Algorithms and Computation","author":"W Tong","year":"2014","unstructured":"Tong, W., Lin, G.: An improved approximation algorithm for the minimum common integer partition problem. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 353\u2013364. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13075-0_28"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/11830924_24","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"DP Woodruff","year":"2006","unstructured":"Woodruff, D.P.: Better approximations for the minimum common integer partition problem. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX\/RANDOM -2006. LNCS, vol. 4110, pp. 248\u2013259. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11830924_24"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78455-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:29:26Z","timestamp":1709810966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78455-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319784540","9783319784557"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78455-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/itcs.shufe.edu.cn\/faw2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}