{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:00:14Z","timestamp":1758585614219,"version":"3.44.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032052278","type":"print"},{"value":"9783032052285","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05228-5_12","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:01:27Z","timestamp":1758474087000},"page":"133-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["String Consensus Problems with\u00a0Swaps and\u00a0Substitutions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9897-1512","authenticated-orcid":false,"given":"Est\u00e9ban","family":"Gabory","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1645-9345","authenticated-orcid":false,"given":"Laurent","family":"Bulteau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3536-327X","authenticated-orcid":false,"given":"Gabriele","family":"Fici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2399-3098","authenticated-orcid":false,"given":"Hilde","family":"Verbeek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Amir, A., Aumann, Y., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms 37(2), 247\u2013266 (2000). https:\/\/doi.org\/10.1006\/jagm.2000.1120. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0196677400911209","DOI":"10.1006\/jagm.2000.1120"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Amir, A., Paryenty, H., Roditty, L.: On the hardness of the consensus string problem. Inf. Process. Lett. 113, 371\u2013374 (2013). https:\/\/doi.org\/10.1016\/j.ipl.2013.02.016","DOI":"10.1016\/j.ipl.2013.02.016"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Amir, A., Landau, G.M., Na, J.C., Park, H., Park, K., Sim, J.S.: Consensus optimizing both distance sum and radius. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) String Processing and Information Retrieval, pp. 234\u2013242. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03784-9_23"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2018.03.024","volume":"730","author":"M Basavaraju","year":"2018","unstructured":"Basavaraju, M., Panolan, F., Rai, A., Ramanujan, M.S., Saurabh, S.: On the kernelization complexity of string problems. Theor. Comput. Sci. 730, 21\u201331 (2018)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.jcss.2010.07.005","volume":"77","author":"N Betzler","year":"2011","unstructured":"Betzler, N., Guo, J., Komusiewicz, C., Niedermeier, R.: Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4), 774\u2013789 (2011)","journal-title":"J. Comput. Syst. Sci."},{"issue":"35","key":"12_CR6","doi-asserted-by":"publisher","first-page":"4570","DOI":"10.1016\/j.tcs.2011.04.039","volume":"412","author":"HL Bodlaender","year":"2011","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35), 4570\u20134578 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1007\/s00453-019-00647-9","volume":"82","author":"L Bulteau","year":"2020","unstructured":"Bulteau, L., Schmid, M.L.: Consensus strings with small maximum distance and small distance sum. Algorithmica 82(5), 1378\u20131409 (2020)","journal-title":"Algorithmica"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Chen, Z.Z., Ma, B., Wang, L.: A three-string approach to the closest string problem. J. Comput. Syst. Sci. 78(1), 164\u2013178 (2012). jCSS Knowledge Representation and Reasoning. https:\/\/doi.org\/10.1016\/j.jcss.2011.01.003","DOI":"10.1016\/j.jcss.2011.01.003"},{"key":"12_CR9","unstructured":"Cunha, L., Lopes, T., Mary, A.: Complexity and algorithms for swap median and relation to other consensus problems (2025). https:\/\/arxiv.org\/abs\/2409.09734"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (2012)","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press (2019)","DOI":"10.1017\/9781107415157"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theor. Comput. Syst. 30, 113\u2013119 (1997)","journal-title":"Theor. Comput. Syst."},{"key":"12_CR13","unstructured":"Gabory, E., Bulteau, L., Fici, G., Verbeek, H.: String consensus problems with swaps and substitutions (2025). https:\/\/arxiv.org\/abs\/2507.19139"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37, 25\u201342 (2003). https:\/\/doi.org\/10.1007\/s00453-003-1028-3","DOI":"10.1007\/s00453-003-1028-3"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Viny Christanti, M., Rudy, R., Naga, D.S.: Fast and accurate spelling correction using Trie and Damerau-levenshtein distance bigram. TELKOMNIKA 16(2), 827\u2013833 (2018). https:\/\/doi.org\/10.12928\/TELKOMNIKA.v16i2.6890","DOI":"10.12928\/TELKOMNIKA.v16i2.6890"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-60044-2_50","volume-title":"Combinatorial Pattern Matching","author":"S Muthukrishnan","year":"1995","unstructured":"Muthukrishnan, S.: New results and open problems related to non-standard stringology. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 298\u2013317. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60044-2_50"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05228-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:01:28Z","timestamp":1758474088000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05228-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"ISBN":["9783032052278","9783032052285"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05228-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"22 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"8 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/spire-2025\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}