{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:40Z","timestamp":1759638700051,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_43","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"599-612","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations)"],"prefix":"10.1007","author":[{"given":"J.","family":"Sawada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"4\/5","key":"43_CR1","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"KS Booth","year":"1980","unstructured":"Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4\/5), 240\u2013242 (1980)","journal-title":"Inf. Process. Lett."},{"key":"43_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2021.102166","volume":"127","author":"A Cantwell","year":"2021","unstructured":"Cantwell, A., Geraci, J., Godbole, A., Padilla, C.: Graph universal cycles of combinatorial objects. Adv. Appl. Math. 127, (2021)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"43_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","volume":"110","author":"F Chung","year":"1992","unstructured":"Chung, F., Diaconis, P., Graham, R.: Universal cycles for combinatorial structures. Discret. Math. 110(1), 43\u201359 (1992)","journal-title":"Discret. Math."},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Diaconis, P., Graham, R.L.: Products of universal cycles. In: Demaine, E., Demaine, M., Rodgers, T. (eds.) A Lifetime of Puzzles, pp. 35\u201355. A K Peters\/CRC Press (2008)","DOI":"10.1201\/b10573-6"},{"issue":"2","key":"43_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(86)90089-0","volume":"61","author":"H Fredricksen","year":"1986","unstructured":"Fredricksen, H., Kessler, I.: An algorithm for generating necklaces of beads in two colors. Discret. Math. 61(2), 181\u2013188 (1986)","journal-title":"Discret. Math."},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H Fredricksen","year":"1978","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in $$k$$ colors and $$k$$-ary de Bruijn sequences. Discret. Math. 23, 207\u2013210 (1978)","journal-title":"Discret. Math."},{"issue":"11","key":"43_CR7","doi-asserted-by":"publisher","first-page":"2977","DOI":"10.1016\/j.disc.2018.07.010","volume":"341","author":"D Gabric","year":"2018","unstructured":"Gabric, D., Sawada, J., Williams, A., Wong, D.: A framework for constructing de Bruijn sequences via simple successor rules. Discret. Math. 341(11), 2977\u20132987 (2018)","journal-title":"Discret. Math."},{"issue":"1","key":"43_CR8","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.2019.2928292","volume":"66","author":"D Gabric","year":"2020","unstructured":"Gabric, D., Sawada, J., Williams, A., Wong, D.: A successor rule framework for constructing $$k$$ -ary de Bruijn sequences and universal cycles. IEEE Trans. Inf. Theory 66(1), 679\u2013687 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"43_CR9","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1215\/ijm\/1255631587","volume":"5","author":"EN Gilbert","year":"1961","unstructured":"Gilbert, E.N., Riordan, J.: Symmetry types of periodic sequences. Illinois J. Math. 5(4), 657\u2013665 (1961)","journal-title":"Illinois J. Math."},{"issue":"2","key":"43_CR10","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00453-011-9544-z","volume":"64","author":"AE Holroyd","year":"2012","unstructured":"Holroyd, A.E., Ruskey, F., Williams, A.: Shorthand universal cycles for permutations. Algorithmica 64(2), 215\u2013245 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"43_CR11","doi-asserted-by":"publisher","first-page":"1360","DOI":"10.1137\/120886807","volume":"27","author":"V Horan","year":"2013","unstructured":"Horan, V., Hurlbert, G.: Universal cycles for weak orders. SIAM J. Discret. Math. 27(3), 1360\u20131371 (2013)","journal-title":"SIAM J. Discret. Math."},{"issue":"17","key":"43_CR12","doi-asserted-by":"publisher","first-page":"5341","DOI":"10.1016\/j.disc.2009.04.002","volume":"309","author":"B Jackson","year":"2009","unstructured":"Jackson, B., Stevens, B., Hurlbert, G.: Research problems on Gray codes and universal cycles. Discret. Math. 309(17), 5341\u20135348 (2009)","journal-title":"Discret. Math."},{"issue":"17","key":"43_CR13","doi-asserted-by":"publisher","first-page":"5264","DOI":"10.1016\/j.disc.2007.11.004","volume":"309","author":"JR Johnson","year":"2009","unstructured":"Johnson, J.R.: Universal cycles for permutations. Discret. Math. 309(17), 5264\u20135270 (2009)","journal-title":"Discret. Math."},{"issue":"23","key":"43_CR14","doi-asserted-by":"publisher","first-page":"3303","DOI":"10.1016\/j.disc.2010.07.016","volume":"310","author":"A Leitner","year":"2010","unstructured":"Leitner, A., Godbole, A.: Universal cycles of classes of restricted words. Discret. Math. 310(23), 3303\u20133309 (2010)","journal-title":"Discret. Math."},{"issue":"1","key":"43_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jcta.2011.07.005","volume":"119","author":"F Ruskey","year":"2012","unstructured":"Ruskey, F., Sawada, J., Williams, A.: Binary bubble languages and cool-lex Gray codes. J. Comb. Theory Ser. A 119(1), 155\u2013169 (2012)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"43_CR16","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/100808782","volume":"26","author":"F Ruskey","year":"2012","unstructured":"Ruskey, F., Sawada, J., Williams, A.: De Bruijn sequences for fixed-weight binary strings. SIAM J. Discret. Math. 26(2), 605\u2013617 (2012)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"43_CR17","first-page":"45","volume":"6","author":"F Ruskey","year":"2010","unstructured":"Ruskey, F., Williams, A.: An explicit universal cycle for the (n-1)-permutations of an n-set. ACM Trans. Algorithms (TALG) 6(3), 45 (2010)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1","key":"43_CR18","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0304-3975(03)00049-5","volume":"301","author":"J Sawada","year":"2003","unstructured":"Sawada, J.: A fast algorithm to generate necklaces with fixed content. Theor. Comput. Sci. 301(1), 477\u2013489 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-19094-0_19","volume-title":"WALCOM: Algorithms and Computation","author":"J Sawada","year":"2011","unstructured":"Sawada, J., Stevens, B., Williams, A.: De Bruijn Sequences for the Binary Strings with Maximum Density. In: Katoh, N., Kumar, A. (eds.) WALCOM 2011. LNCS, vol. 6552, pp. 182\u2013190. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19094-0_19"},{"key":"43_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-45278-9_33","volume-title":"Combinatorial Algorithms","author":"J Sawada","year":"2013","unstructured":"Sawada, J., Williams, A., Wong, D.: Universal Cycles for Weight-Range Binary Strings. In: Lecroq, T., Mouchard, L. (eds.) IWOCA 2013. LNCS, vol. 8288, pp. 388\u2013401. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45278-9_33"},{"key":"43_CR21","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A., Wong, D.: The lexicographically smallest universal cycle for binary strings with minimum specified weight. J. Discret. Algorithms 28, 31\u201340 (2014). StringMasters 2012, 2013 Special Issue (Volume 1)","DOI":"10.1016\/j.jda.2014.06.003"},{"key":"43_CR22","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A., Wong, D.: Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles. Electron. J. Comb. 23(1), P1.24 (2016)","DOI":"10.37236\/5517"},{"issue":"10","key":"43_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112022","volume":"343","author":"J Sawada","year":"2020","unstructured":"Sawada, J., Wong, D.: Efficient universal cycle constructions for weak orders. Discret. Math. 343(10), (2020)","journal-title":"Discret. Math."},{"key":"43_CR24","doi-asserted-by":"crossref","unstructured":"Williams, A.: Loopless generation of multiset permutations using a constant number of variables by prefix shifts. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, pp. 987\u2013996. SIAM (2009) SODA 2009, pp. 987\u2013996. SIAM (2009)","DOI":"10.1137\/1.9781611973068.107"},{"key":"43_CR25","unstructured":"Williams, A.: Shift Gray codes. PhD thesis, University of Victoria (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:29:09Z","timestamp":1645183749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"38% - 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.1","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":"13","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)"}}]}}