{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:58:04Z","timestamp":1753275484226,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031556005"},{"type":"electronic","value":"9783031556012"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55601-2_5","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:02:17Z","timestamp":1709665337000},"page":"61-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Structural and\u00a0Combinatorial Properties of\u00a02-Swap Word Permutation Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3343-2435","authenticated-orcid":false,"given":"Duncan","family":"Adamson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2798-4084","authenticated-orcid":false,"given":"Nathan","family":"Flaherty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7192-7853","authenticated-orcid":false,"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5396-3749","authenticated-orcid":false,"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-02882-3_19","volume-title":"Computing and Combinatorics","author":"M Ackerman","year":"2009","unstructured":"Ackerman, M., M\u00e4kinen, E.: Three new algorithms for regular language enumeration. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 178\u2013191. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02882-3_19"},{"issue":"37","key":"5_CR2","doi-asserted-by":"publisher","first-page":"3461","DOI":"10.1016\/j.tcs.2009.03.018","volume":"410","author":"M Ackerman","year":"2009","unstructured":"Ackerman, M., Shallit, J.: Efficient enumeration of words in regular languages. Theoret. Comput. Sci. 410(37), 3461\u20133470 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Adamson, D.: Ranking and unranking $$k$$-subsequence universal words. In: WORDS, p. 47\u201359. Springer Nature Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-33180-0_4","DOI":"10.1007\/978-3-031-33180-0_4"},{"issue":"3","key":"5_CR4","first-page":"181","volume":"184","author":"D Adamson","year":"2021","unstructured":"Adamson, D., Deligkas, A., Gusev, V., Potapov, I.: On the hardness of energy minimisation for crystal structure prediction. Fund. Inform. 184(3), 181\u2013203 (2021)","journal-title":"Fund. Inform."},{"key":"5_CR5","unstructured":"Adamson, D., Deligkas, A., Gusev, V.V., Potapov, I.: The complexity of periodic energy minimisation. In: MFCS 2022. LIPIcs, vol. 241, pp. 8:1\u20138:15 (2022)"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Adamson, D., Deligkas, A., Gusev, V.V., Potapov, I.: The k-centre problem for classes of cyclic words. In SOFSEM 2023. LNCS, vol. 13878, pp. 385\u2013400. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-23101-8_26","DOI":"10.1007\/978-3-031-23101-8_26"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Adamson, D., Flaherty, N., Potapov, I., Spirakis, P.: Structural and combinatorial properties of 2-swap word permutation graphs. arXiv:2307.01648 (2023)","DOI":"10.2139\/ssrn.4921168"},{"key":"5_CR8","unstructured":"Adamson, D., Gusev, V.V., Potapov, I., Deligkas, A.: Ranking Bracelets in Polynomial Time. In: CPM 2023, LIPIcs, vol. 191, pp. 4:1\u20134:17 (2021)"},{"issue":"10","key":"5_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.ipl.2013.02.016","volume":"113","author":"A Amir","year":"2013","unstructured":"Amir, A., Paryenty, H., Roditty, L.: On the hardness of the consensus string problem. Inf. Process. Lett. 113(10), 371\u2013374 (2013)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1016\/j.aim.2007.05.019","volume":"215","author":"O Angel","year":"2007","unstructured":"Angel, O., Holroyd, A., Romik, D., Vir\u00e1g, B.: Random sorting networks. Adv. Math. 215(2), 839\u2013868 (2007)","journal-title":"Adv. Math."},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0195-6698(05)80029-0","volume":"13","author":"L Babai","year":"1992","unstructured":"Babai, L., Seress, A.: On the diameter of permutation groups. Eur. J. Comb. 13(4), 231\u2013243 (1992)","journal-title":"Eur. J. Comb."},{"issue":"2\u20133","key":"5_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(84)90179-1","volume":"48","author":"M Buck","year":"1984","unstructured":"Buck, M., Wiedemann, D.: Gray codes with restricted density. Discret. Math. 48(2\u20133), 163\u2013171 (1984)","journal-title":"Discret. Math."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1039\/C8FD00045J","volume":"211","author":"C Collins","year":"2018","unstructured":"Collins, C., Darling, G.R., Rosseinsky, M.J.: The flexible unit structure engine (FUSE) for probe structure-based composition prediction. Faraday Discuss. 211, 117\u2013131 (2018)","journal-title":"Faraday Discuss."},{"issue":"7657","key":"5_CR14","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1038\/nature22374","volume":"546","author":"C Collins","year":"2017","unstructured":"Collins, C., et al.: Accelerated discovery of two crystal structure types in a complex inorganic phase field. Nature 546(7657), 280\u2013284 (2017)","journal-title":"Nature"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific (2003)","DOI":"10.1142\/9789812778222"},{"key":"5_CR16","unstructured":"Ganczorz, M., Gawrychowski, P., Jez, A., Kociumaka, T.: Edit distance with block operations. In: ESA, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0012-365X(02)00870-1","volume":"271","author":"W Goddard","year":"2003","unstructured":"Goddard, W., Raines, M.E., Slater, P.J.: Distance and connectivity measures in permutation graphs. Discret. Math. 271(1), 61\u201370 (2003)","journal-title":"Discret. Math."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Helfgott, H.A., Seress, \u00c1.: On the diameter of permutation groups. Annals of Mathematics, pp. 611\u2013658 (2014)","DOI":"10.4007\/annals.2014.179.2.4"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.jalgebra.2014.08.033","volume":"421","author":"HA Helfgott","year":"2015","unstructured":"Helfgott, H.A., Seress, \u00c1., Zuk, A.: Random generators of the symmetric group: diameter, mixing time and spectral gap. J. Algebra 421, 349\u2013368 (2015)","journal-title":"J. Algebra"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(85)90047-7","volume":"36","author":"MR Jerrum","year":"1985","unstructured":"Jerrum, M.R.: The complexity of finding minimum-length generator sequences. Theoret. Comput. Sci. 36, 265\u2013289 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Konstantinova, E.: Some problems on cayley graphs. Linear Algebra Appli. 429(11), 2754\u20132769 (2008); Special Issue devoted to selected papers presented at the first IPM Conference on Algebraic Graph Theory","DOI":"10.1016\/j.laa.2008.05.010"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Kornhauser, D., Miller, G.L., Spirakis, P.G.: Coordinating pebble motion on graphs, the diameter of permutation groups, and applications. In: FOCS 1984, pp. 241\u2013250. IEEE Computer Society (1984)","DOI":"10.1109\/SFCS.1984.715921"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Levy, A.: Exploiting pseudo-locality of interchange distance. In: SPIRE 2021, pp. 227\u2013240. Springer (2021), https:\/\/doi.org\/10.1007\/978-3-030-86692-1_19","DOI":"10.1007\/978-3-030-86692-1_19"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/978-3-319-26626-8_57","volume-title":"Combinatorial Optimization and Applications","author":"H Maji","year":"2015","unstructured":"Maji, H., Izumi, T.: Listing center strings under the edit distance metric. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 771\u2013782. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_57"},{"issue":"1","key":"5_CR25","first-page":"55","volume":"13","author":"E M\u00e4kinen","year":"1997","unstructured":"M\u00e4kinen, E.: On lexicographic enumeration of regular and context-free languages. Acta Cybernet. 13(1), 55\u201361 (1997)","journal-title":"Acta Cybernet."},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"M\u00fctze, T.: Combinatorial Gray codes - an updated survey. arXiv preprint arXiv:2202.01280 (2022)","DOI":"10.37236\/11023"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Ruskey, F., Savage, C., Min Yih Wang, T.: Generating necklaces. J. Algorithms 13(3), 414\u2013430 (1992)","DOI":"10.1016\/0196-6774(92)90047-G"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Schmid, M.L., Schweikardt, N.: Spanner evaluation over slp-compressed documents. In: PODS 2021, pp. 153\u2013165. ACM (2021)","DOI":"10.1145\/3452021.3458325"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Schmid, M.L., Schweikardt, N.: Query evaluation over slp-represented document databases with complex document editing. In: PODS 2022, pp. 79\u201389. ACM (2022)","DOI":"10.1145\/3517804.3524158"},{"key":"5_CR30","unstructured":"Wasa, K.: Enumeration of enumeration algorithms. arXiv e-prints, pp. 1605 (2016)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55601-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T21:35:16Z","timestamp":1731533716000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55601-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556005","9783031556012"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55601-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"92","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":"44","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":"48% - 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.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}