{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:19:04Z","timestamp":1757452744822,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332630"},{"type":"electronic","value":"9783031332647"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33264-7_3","type":"book-chapter","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T08:03:26Z","timestamp":1684397006000},"page":"23-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Isometric Words Based on Swap and Mismatch Distance"],"prefix":"10.1007","author":[{"given":"M.","family":"Anselmo","sequence":"first","affiliation":[]},{"given":"G.","family":"Castiglione","sequence":"additional","affiliation":[]},{"given":"M.","family":"Flores","sequence":"additional","affiliation":[]},{"given":"D.","family":"Giammarresi","sequence":"additional","affiliation":[]},{"given":"M.","family":"Madonia","sequence":"additional","affiliation":[]},{"given":"S.","family":"Mantaci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0890-5401(02)00035-4","volume":"181","author":"A Amir","year":"2003","unstructured":"Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Inf. Comput. 181(1), 57\u201374 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00453-005-1192-8","volume":"45","author":"A Amir","year":"2006","unstructured":"Amir, A., Eisenberg, E., Porat, E.: Swap and mismatch edit distance. Algorithmica 45(1), 109\u2013120 (2006)","journal-title":"Algorithmica"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-85088-3_3","volume-title":"Combinatorics on Words","author":"M Anselmo","year":"2021","unstructured":"Anselmo, M., Flores, M., Madonia, M.: Quaternary n-cubes and isometric words. In: Lecroq, T., Puzynina, S. (eds.) WORDS 2021. LNCS, vol. 12847, pp. 27\u201339. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85088-3_3"},{"key":"3_CR4","unstructured":"Anselmo, M., Flores, M., Madonia, M.: Fun slot machines and transformations of words avoiding factors. In: 11th International Conference on Fun with Algorithms. LIPIcs, vol. 226, pp. 4:1\u20134:15 (2022)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2022.10.007","volume":"938","author":"M Anselmo","year":"2022","unstructured":"Anselmo, M., Flores, M., Madonia, M.: On k-ary n-cubes and isometric words. Theor. Comput. Sci. 938, 50\u201364 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-62536-8_2","volume-title":"Descriptional Complexity of Formal Systems","author":"M Anselmo","year":"2020","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M., Selmi, C.: Bad pictures: some structural properties related to overlaps. In: Jir\u00e1skov\u00e1, G., Pighizzini, G. (eds.) DCFS 2020. LNCS, vol. 12442, pp. 13\u201325. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62536-8_2"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2022.08.032","volume":"933","author":"M B\u00e9al","year":"2022","unstructured":"B\u00e9al, M., Crochemore, M.: Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. 933, 55\u201359 (2022)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-60922-9_45","volume-title":"STACS 96","author":"M-P B\u00e9al","year":"1996","unstructured":"B\u00e9al, M.-P., Mignosi, F., Restivo, A.: Minimal forbidden words and symbolic dynamics. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 555\u2013566. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60922-9_45"},{"issue":"1\u20134","key":"3_CR9","first-page":"97","volume":"171","author":"G Castiglione","year":"2020","unstructured":"Castiglione, G., Mantaci, S., Restivo, A.: Some investigations on similarity measures based on absent words. Fundam. Informaticae 171(1\u20134), 97\u2013112 (2020)","journal-title":"Fundam. Informaticae"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ic.2018.06.002","volume":"262","author":"P Charalampopoulos","year":"2018","unstructured":"Charalampopoulos, P., Crochemore, M., Fici, G., Mercas, R., Pissis, S.P.: Alignment-free sequence comparison using absent words. Inf. Comput. 262, 57\u201368 (2018)","journal-title":"Inf. Comput."},{"issue":"43","key":"3_CR11","doi-asserted-by":"publisher","first-page":"3814","DOI":"10.1016\/j.tcs.2010.06.004","volume":"411","author":"Y Dombb","year":"2010","unstructured":"Dombb, Y., Lipsky, O., Porat, B., Porat, E., Tsur, A.: The approximate swap and mismatch edit distance. Theor. Comput. Sci. 411(43), 3814\u20133822 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"9","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1093\/comjnl\/bxx123","volume":"61","author":"S Faro","year":"2018","unstructured":"Faro, S., Pavone, A.: An efficient skip-search approach to swap matching. Comput. J. 61(9), 1351\u20131360 (2018)","journal-title":"Comput. J."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1137\/0219067","volume":"19","author":"Z Galil","year":"1990","unstructured":"Galil, Z., Park, K.: An improved algorithm for approximate string matching. SIAM J. Comput. 19, 989\u2013999 (1990)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/71.205649","volume":"4","author":"WJ Hsu","year":"1993","unstructured":"Hsu, W.J.: Fibonacci cubes-a new interconnection topology. IEEE Trans. Parallel Distrib. Syst. 4(1), 3\u201312 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2012.05.025","volume":"452","author":"A Ili\u0107","year":"2012","unstructured":"Ili\u0107, A., Klav\u017ear, S., Rho, Y.: The index of a binary word. Theor. Comput. Sci. 452, 100\u2013106 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.ejc.2011.10.001","volume":"33","author":"S Klav\u017ear","year":"2012","unstructured":"Klav\u017ear, S., Shpectorov, S.V.: Asymptotic number of isometric generalized Fibonacci cubes. Eur. J. Comb. 33(2), 220\u2013226 (2012)","journal-title":"Eur. J. Comb."},{"key":"3_CR17","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Cybern. Control Theory 10, 707\u2013710 (1966)","journal-title":"Cybern. Control Theory"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Wagner, R.A.: On the complexity of the extended string-to-string correction problem. In: Rounds, W.C., Martin, N., Carlyle, J.W., Harrison, M.A. (eds.) Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 5\u20137 May 1975, Albuquerque, New Mexico, USA, pp. 218\u2013223 (1975)","DOI":"10.1145\/800116.803771"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ejc.2016.05.003","volume":"59","author":"J Wei","year":"2017","unstructured":"Wei, J.: The structures of bad words. Eur. J. Comb. 59, 204\u2013214 (2017)","journal-title":"Eur. J. Comb."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.ejc.2019.02.001","volume":"78","author":"J Wei","year":"2019","unstructured":"Wei, J., Yang, Y., Zhu, X.: A characterization of non-isometric binary words. Eur. J. Comb. 78, 121\u2013133 (2019)","journal-title":"Eur. J. Comb."},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.ejc.2015.07.018","volume":"51","author":"J Wei","year":"2016","unstructured":"Wei, J., Zhang, H.: Proofs of two conjectures on generalized Fibonacci cubes. Eur. J. Comb. 51, 419\u2013432 (2016)","journal-title":"Eur. J. Comb."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33264-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T16:17:12Z","timestamp":1729441032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33264-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332630","9783031332647"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33264-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dltwords2023.cs.umu.se\/dlt","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4- Invited papers and 32 submissions (31 regular ones and one invited)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}