{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:40:43Z","timestamp":1757450443190,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343254"},{"type":"electronic","value":"9783031343261"}],"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-34326-1_2","type":"book-chapter","created":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:04:23Z","timestamp":1687604663000},"page":"21-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hypercubes and\u00a0Isometric Words Based on\u00a0Swap and\u00a0Mismatch Distance"],"prefix":"10.1007","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppa","family":"Castiglione","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuela","family":"Flores","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dora","family":"Giammarresi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabrina","family":"Mantaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,24]]},"reference":[{"issue":"1","key":"2_CR1","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":"2_CR2","doi-asserted-by":"crossref","unstructured":"Anselmo, M., Castiglione, G., Flores, M., Giammarresi, D., Madonia, M., Mantaci, S.: Isometric words based on swap and mismatch distance. CORR abs\/2303.03086 (2023)","DOI":"10.1007\/978-3-031-33264-7_3"},{"key":"2_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":"2_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":"2_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":"2_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":"2_CR7","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.ejc.2015.05.011","volume":"51","author":"J Azarija","year":"2016","unstructured":"Azarija, J., Klav\u017ear, S., Lee, J., Pantone, J., Rho, Y.: On isomorphism classes of generalized Fibonacci cubes. Europ. J. Comb. 51, 372\u2013379 (2016)","journal-title":"Europ. J. Comb."},{"key":"2_CR8","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."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/71.80187","volume":"2","author":"A El-Amawy","year":"1991","unstructured":"El-Amawy, A., Latifi, S.: Properties and performance of folded hypercubes. IEEE Trans. Parallel Distrib. Syst. 2(1), 31\u201342 (1991)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"9","key":"2_CR10","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."},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0898-1221(88)90213-1","volume":"15","author":"F Harary","year":"1988","unstructured":"Harary, F., Hayes, J., Wu, H.: A survey of the theory of hypercube graphs. Comput. Math. Appl. 15(4), 277\u2013289 (1988)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"2_CR12","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."},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.disc.2011.02.015","volume":"312","author":"A Ili\u0107","year":"2012","unstructured":"Ili\u0107, A., Klav\u017ear, S., Rho, Y.: Generalized Fibonacci cubes. Discrete Math. 312(1), 2\u201311 (2012)","journal-title":"Discrete Math."},{"key":"2_CR14","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":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s10878-011-9433-z","volume":"25","author":"S Klav\u017ear","year":"2013","unstructured":"Klav\u017ear, S.: Structure of Fibonacci cubes: a survey. J. Comb. Optim. 25(4), 505\u2013522 (2013)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"2_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."},{"issue":"1\u20133","key":"2_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0012-365X(01)00407-1","volume":"255","author":"E Munarini","year":"2002","unstructured":"Munarini, E., Salvi, N.Z.: Structural and enumerative properties of the Fibonacci cubes. Discret. Math. 255(1\u20133), 317\u2013324 (2002)","journal-title":"Discret. Math."},{"key":"2_CR18","unstructured":"Sloane, N.: On-line encyclopedia of integer sequences. http:\/\/oeis.org\/"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/12.76405","volume":"40","author":"N Tzeng","year":"1991","unstructured":"Tzeng, N., Wei, S.: Enhanced hypercubes. IEEE Trans. Comput. 40(3), 284\u2013294 (1991)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"2_CR20","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"RA Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"key":"2_CR21","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":"2_CR22","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":"2_CR23","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tcs.2020.11.026","volume":"855","author":"J Wei","year":"2021","unstructured":"Wei, J.: Proof of a conjecture on 2-isometric words. Theor. Comput. Sci. 855, 68\u201373 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"2_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112024","volume":"343","author":"J Wei","year":"2020","unstructured":"Wei, J., Yang, Y., Wang, G.: Circular embeddability of isometric words. Discret. Math. 343(10), 112024 (2020)","journal-title":"Discret. Math."},{"key":"2_CR25","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":"2_CR26","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","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34326-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:00:32Z","timestamp":1729634432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34326-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343254","9783031343261"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34326-1_2","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":"24 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"4 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.uni-potsdam.de\/dcfs2023\/","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":"16","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":"14","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":"88% - 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":"2.35","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)"}}]}}