{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:18:37Z","timestamp":1743088717919,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_17","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:14:46Z","timestamp":1740140086000},"page":"266-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Algorithms for\u00a0the\u00a0Spanning Forest Isomorphism (or Containment) on\u00a0Tree Problems"],"prefix":"10.1007","author":[{"given":"Jingyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xian","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"key":"17_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/S10878-013-9692-Y","volume":"29","author":"J Baumbach","year":"2015","unstructured":"Baumbach, J., Guo, J., Ibragimov, R.: Covering tree with stars. J. Comb. Optim. 29(1), 141\u2013152 (2015). https:\/\/doi.org\/10.1007\/S10878-013-9692-Y","journal-title":"J. Comb. Optim."},{"key":"17_CR3","doi-asserted-by":"publisher","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 67\u201374 (2007). https:\/\/doi.org\/10.1145\/1250790.1250801","DOI":"10.1145\/1250790.1250801"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-40453-5_19","volume-title":"Algorithms in Bioinformatics","author":"L Bulteau","year":"2013","unstructured":"Bulteau, L., Fertin, G., Komusiewicz, C., Rusu, I.: A fixed-parameter algorithm for minimum common string partition with few duplications. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol. 8126, pp. 244\u2013258. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40453-5_19"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Bulteau, L., Komusiewicz, C.: Minimum common string partition parameterized by partition size is fixed-parameter tractable. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 102\u2013121 (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.8","DOI":"10.1137\/1.9781611973402.8"},{"key":"17_CR6","unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Bansal, N., Pruhs, K., Stein, C. (eds.) Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 298\u2013307 (2007)"},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TCBB.2005.48","volume":"2","author":"X Chen","year":"2005","unstructured":"Chen, X., et al.: Assignment of orthologous genes via genome rearrangement. IEEE\/ACM Trans. Comput. Biol. Bioinform. 2(4), 302\u2013315 (2005). https:\/\/doi.org\/10.1109\/TCBB.2005.48","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"17_CR8","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol. 5. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"key":"17_CR9","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":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-07956-1_2","volume-title":"Algorithmic Aspects in Information and Management","author":"H Jiang","year":"2014","unstructured":"Jiang, H., Su, B., Xiao, M., Xu, Y., Zhong, F., Zhu, B.: On the exact block cover problem. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 13\u201322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07956-1_2"},{"key":"17_CR11","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, 519\u2013527 (2012). https:\/\/doi.org\/10.1007\/S10878-010-9370-2","journal-title":"J. Comb. Optim."},{"issue":"9","key":"17_CR12","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.K., 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":"12","key":"17_CR13","doi-asserted-by":"publisher","first-page":"2408","DOI":"10.1109\/TKDE.2018.2831214","volume":"30","author":"G Kul","year":"2018","unstructured":"Kul, G., Luong, D.T.A., Xie, T., Chandola, V., Kennedy, O., Upadhyaya, S.J.: Similarity metrics for SQL query clustering. IEEE Trans. Knowl. Data Eng. 30(12), 2408\u20132420 (2018). https:\/\/doi.org\/10.1109\/TKDE.2018.2831214","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/J.TCS.2021.06.036","volume":"886","author":"F Shi","year":"2021","unstructured":"Shi, F., You, J., Zhang, Z., Liu, J., Wang, J.: Fixed-parameter tractability for the tree assembly problem. Theoret. Comput. Sci. 886, 3\u201312 (2021). https:\/\/doi.org\/10.1016\/J.TCS.2021.06.036","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/J.TCS.2019.04.003","volume":"806","author":"J You","year":"2020","unstructured":"You, J., Shi, F., Wang, J., Feng, Q.: Fixed-parameter tractability for minimum tree cut\/paste distance and minimum common integer partition. Theoret. Comput. Sci. 806, 256\u2013270 (2020). https:\/\/doi.org\/10.1016\/J.TCS.2019.04.003","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/J.TCS.2015.06.030","volume":"607","author":"J You","year":"2015","unstructured":"You, J., Wang, J., Feng, Q., Shi, F.: Kernelization and parameterized algorithms for covering a tree by a set of stars or paths. Theoret. Comput. Sci. 607, 257\u2013270 (2015). https:\/\/doi.org\/10.1016\/J.TCS.2015.06.030","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:14:50Z","timestamp":1740140090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}