{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:42:02Z","timestamp":1720201322966},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T00:00:00Z","timestamp":1664150400000},"content-version":"vor","delay-in-days":1486,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1016\/j.tcs.2018.06.021","type":"journal-article","created":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T18:09:26Z","timestamp":1529690966000},"page":"38-52","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Bubble-Flip\u2014A new generation algorithm for prefix normal words"],"prefix":"10.1016","volume":"743","author":[{"given":"Ferdinando","family":"Cicalese","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3233-0691","authenticated-orcid":false,"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"additional","affiliation":[]},{"given":"Massimiliano","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2018.06.021_br0010","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.tcs.2016.04.030","article-title":"Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings","volume":"656","author":"Amir","year":"2016","journal-title":"Theoret. Comput. Sci."},{"issue":"2016","key":"10.1016\/j.tcs.2018.06.021_br0020","doi-asserted-by":"crossref","DOI":"10.1098\/rsta.2013.0132","article-title":"On the relationship between histogram indexing and block-mass indexing","volume":"372","author":"Amir","year":"2014","journal-title":"Philos. Trans. R. Soc. A: Math. Phys. Eng. Sci."},{"key":"10.1016\/j.tcs.2018.06.021_br0030","series-title":"41st International Colloquium on Automata, Languages, and Programming","first-page":"114","article-title":"On hardness of jumbled indexing","volume":"vol. 8572","author":"Amir","year":"2014"},{"key":"10.1016\/j.tcs.2018.06.021_br0040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2018.04.019","article-title":"Leaf realization problem, caterpillar graphs and prefix normal words","volume":"732","author":"Blondin Mass\u00e9","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2018.06.021_br0050","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1142\/S0129054112400175","article-title":"Algorithms for jumbled pattern matching in strings","volume":"23","author":"Burcsi","year":"2012","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/j.tcs.2018.06.021_br0060","series-title":"Proc. of the 7th International Conference on Fun with Algorithms","first-page":"74","article-title":"Normal, abby normal, prefix normal","volume":"vol. 8496","author":"Burcsi","year":"2014"},{"key":"10.1016\/j.tcs.2018.06.021_br0070","series-title":"Proc. of the 25th Ann. Symp. on Comb. Pattern Matching","first-page":"60","article-title":"On combinatorial generation of prefix normal words","volume":"vol. 8486","author":"Burcsi","year":"2014"},{"key":"10.1016\/j.tcs.2018.06.021_br0080","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.10.015","article-title":"On prefix normal words and prefix normal forms","volume":"659","author":"Burcsi","year":"2017","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2018.06.021_br0090","series-title":"Proc. of the 47th Ann. ACM on Symp. on Theory of Computing","first-page":"31","article-title":"Clustered integer 3SUM via additive combinatorics","author":"Chan","year":"2015"},{"key":"10.1016\/j.tcs.2018.06.021_br0100","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.tcs.2013.05.032","article-title":"Approximating the maximum consecutive subsums of a sequence","volume":"525","author":"Cicalese","year":"2014","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2018.06.021_br0110","series-title":"Proc. of the 12th International Conference Language and Automata Theory and Applications","first-page":"207","article-title":"Bubble-flip\u2014a new generation algorithm for prefix normal words","volume":"vol. 10792","author":"Cicalese","year":"2018"},{"key":"10.1016\/j.tcs.2018.06.021_br0120","series-title":"28th Annual Symposium on Combinatorial Pattern Matching","first-page":"19:1","article-title":"Faster jumbled indexing for binary RLE strings","volume":"vol. 78","author":"Cunha","year":"2017"},{"key":"10.1016\/j.tcs.2018.06.021_br0130","series-title":"Proc. of the 15th Intern. Conf. on Developments in Language Theory","first-page":"228","article-title":"On prefix normal words","volume":"vol. 6795","author":"Fici","year":"2011"},{"issue":"3","key":"10.1016\/j.tcs.2018.06.021_br0140","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/s00453-014-9957-6","article-title":"Binary jumbled pattern matching on trees and tree-like structures","volume":"73","author":"Gagie","year":"2015","journal-title":"Algorithmica"},{"issue":"14\u201316","key":"10.1016\/j.tcs.2018.06.021_br0150","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1016\/j.ipl.2013.04.013","article-title":"New algorithms for binary jumbled pattern matching","volume":"113","author":"Giaquinta","year":"2013","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2018.06.021_br0160","author":"Knuth"},{"key":"10.1016\/j.tcs.2018.06.021_br0170","series-title":"The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions","author":"Knuth","year":"2005"},{"issue":"4","key":"10.1016\/j.tcs.2018.06.021_br0180","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1007\/s00453-016-0140-0","article-title":"Efficient indexes for jumbled pattern matching with constant-sized alphabet","volume":"77","author":"Kociumaka","year":"2017","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2018.06.021_br0190","series-title":"Algebraic Combinatorics on Words","author":"Lothaire","year":"2002"},{"key":"10.1016\/j.tcs.2018.06.021_br0200","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.jda.2011.08.003","article-title":"Sub-quadratic time and linear space data structures for permutation matching in binary strings","volume":"10","author":"Moosa","year":"2012","journal-title":"J. Discrete Algorithms"},{"key":"10.1016\/j.tcs.2018.06.021_br0210","unstructured":"F. Ruskey, Combinatorial generation, 2003."},{"issue":"1","key":"10.1016\/j.tcs.2018.06.021_br0220","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.jcta.2011.07.005","article-title":"Binary bubble languages and cool-lex order","volume":"119","author":"Ruskey","year":"2012","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"10.1016\/j.tcs.2018.06.021_br0230","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/100808782","article-title":"De Bruijn sequences for fixed-weight binary strings","volume":"26","author":"Ruskey","year":"2012","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/j.tcs.2018.06.021_br0240","doi-asserted-by":"crossref","first-page":"P42","DOI":"10.37236\/2051","article-title":"Efficient oracles for generating binary bubble languages","volume":"19","author":"Sawada","year":"2012","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.tcs.2018.06.021_br0250","unstructured":"J. Sawada, A. Williams, D. Wong, Inside the binary reflected Gray code: Flip-Swap languages in 2-Gray code order, 2017, unpublished manuscript."},{"key":"10.1016\/j.tcs.2018.06.021_br0260","author":"Sloane"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518304377?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397518304377?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T20:26:32Z","timestamp":1664223992000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397518304377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":26,"alternative-id":["S0304397518304377"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2018.06.021","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2018,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Bubble-Flip\u2014A new generation algorithm for prefix normal words","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2018.06.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}