{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T12:33:18Z","timestamp":1772368398028,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,6,29]],"date-time":"2007-06-29T00:00:00Z","timestamp":1183075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2007,8,2]]},"DOI":"10.1007\/s00236-007-0053-0","type":"journal-article","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T10:32:30Z","timestamp":1183026750000},"page":"361-376","source":"Crossref","is-referenced-by-count":8,"title":["A general exhaustive generation algorithm for Gray structures"],"prefix":"10.1007","volume":"44","author":[{"given":"Antonio","family":"Bernini","sequence":"first","affiliation":[]},{"given":"Elisabetta","family":"Grazzini","sequence":"additional","affiliation":[]},{"given":"Elisa","family":"Pergola","sequence":"additional","affiliation":[]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,29]]},"reference":[{"issue":"8","key":"53_CR1","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s00236-004-0139-x","volume":"40","author":"S. Bacchelli","year":"2004","unstructured":"Bacchelli S., Barcucci E., Grazzini E. and Pergola E. (2004). Exhaustive generation of combinatorial objects by ECO. Acta Inform. 40(8): 585\u2013602","journal-title":"Acta Inform."},{"key":"53_CR2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P. Bose","year":"1998","unstructured":"Bose P., Buss J.F. and Lubiw A. (1998). Pattern matching for permutations. Inform. Process. Lett. 65: 277\u2013283","journal-title":"Inform. Process. Lett."},{"key":"53_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(01)00250-3","volume":"246","author":"C. Banderier","year":"2002","unstructured":"Banderier C., Bousquet-M\u00e9lou M., Denise A., Flajolet P., Gardy D. and Gouyou-Beauchamps D. (2002). Generating functions for generating trees. Discrete Math. 246: 29\u201355","journal-title":"Discrete Math."},{"key":"53_CR4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0304-3975(98)00322-3","volume":"218","author":"E. Barcucci","year":"1999","unstructured":"Barcucci E., Del Lungo A. and Pergola E. (1999). Random generation of trees and other combinatorial objects. Theoret. Comput. Sci 218: 219\u2013232","journal-title":"Theoret. Comput. Sci"},{"key":"53_CR5","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1080\/10236199908808200","volume":"5","author":"E. Barcucci","year":"1999","unstructured":"Barcucci E., Del Lungo A., Pergola E. and Pinzani R. (1999). ECO: a methodology for the enumeration of combinatorial objects,. J. Differ. Equ. Appl. 5: 435\u2013490","journal-title":"J. Differ. Equ. Appl."},{"key":"53_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01608782","volume":"3","author":"E. Barcucci","year":"1999","unstructured":"Barcucci E., Del Lungo A., Pergola E. and Pinzani R. (1999). Some combinatorial interpretations of q-analogs of Schr\u00f6der numbers. Ann. Combin. 3: 171\u2013190","journal-title":"Ann. Combin."},{"key":"53_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.dam.2003.06.002","volume":"140","author":"J. Baril","year":"2004","unstructured":"Baril J. and Vajnovszki V. (2004). Gray code for derangements. Discrete Appl. Math. 140: 207\u2013221","journal-title":"Discrete Appl. Math."},{"key":"53_CR8","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/360336.360343","volume":"19","author":"J.R. Bitner","year":"1976","unstructured":"Bitner J.R., Ehrlich G. and Reingold E.M. (1976). Efficient generation of the binary reflected Gray code and its applications. Commun. ACM 19: 517\u2013521","journal-title":"Commun. ACM"},{"key":"53_CR9","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.disc.2004.07.019","volume":"298","author":"S. Brlek","year":"2005","unstructured":"Brlek S., Duchi E., Pergola E. and Rinaldi S. (2005). On the equivalence problem for succession rules. Discrete Math. 298: 142\u2013154","journal-title":"Discrete Math."},{"key":"53_CR10","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0097-3165(78)90068-7","volume":"24","author":"F.R.K. Chung","year":"1978","unstructured":"Chung F.R.K., Graham R.L., Hoggat V.E. and Kleiman M. (1978). The number of Baxter permutations. J. Combin. Theory Ser. A 24: 382\u2013394","journal-title":"J. Combin. Theory Ser. A"},{"key":"53_CR11","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1090\/S0025-5718-1963-0159764-2","volume":"17","author":"S.M. Johnson","year":"1963","unstructured":"Johnson S.M. (1963). Generation of permutations by adjacent transpositions. Math. Comp. 17: 282\u2013285","journal-title":"Math. Comp."},{"key":"53_CR12","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1109\/TCOM.1981.1094886","volume":"29","author":"J.E. Ludman","year":"1981","unstructured":"Ludman J.E. (1981). Gray code generation for MPSK signals. IEEE Trans. Commun. COM 29: 1519\u20131522","journal-title":"IEEE Trans. Commun. COM"},{"key":"53_CR13","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/S0304-3975(01)00085-8","volume":"270","author":"E. Pegola","year":"2002","unstructured":"Pegola E., Pinzani R. and Rinaldi S. (2002). Approximating algebraic function by means of rational ones. Theoret. Comput. Sci. 270: 643\u2013657","journal-title":"Theoret. Comput. Sci."},{"key":"53_CR14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0196-6774(90)90030-I","volume":"11","author":"F. Ruskey","year":"1990","unstructured":"Ruskey F. and Proskurowski A. (1990). Generating binary trees by transpositions. J. Algorithms 11: 68\u201384","journal-title":"J. Algorithms"},{"issue":"1","key":"53_CR15","first-page":"15","volume":"5","author":"V. Vajnovszki","year":"1996","unstructured":"Vajnovszki V. (1996). Constant time algorithm for generating binary trees gray codes. Stud. Inform. Control 5(1): 15\u201321","journal-title":"Stud. Inform. Control"},{"key":"53_CR16","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1007\/s00236-002-0097-0","volume":"38","author":"V. Vajnovszki","year":"2002","unstructured":"Vajnovszki V. (2002). Gray visiting Motzkin. Acta Inform. 38: 793\u2013811","journal-title":"Acta Inform."},{"key":"53_CR17","first-page":"73","volume":"2731","author":"T. Walsh","year":"2003","unstructured":"Walsh T. (2003). Generating Gray Codes in O(1) worst-case time per word. LNCS 2731: 73\u201388","journal-title":"LNCS"},{"key":"53_CR18","first-page":"95","volume":"36","author":"T. Walsh","year":"2001","unstructured":"Walsh T. (2001). Gray codes for involutions. J. Combin. Math. Combin. Comput. 36: 95\u2013118","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"53_CR19","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(94)00067-1","volume":"146","author":"J. West","year":"1995","unstructured":"West J. (1995). Generating trees and the Catalan and Schr\u00f6der numbers. Discrete Math. 146: 247\u2013262","journal-title":"Discrete Math."},{"key":"53_CR20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0012-365X(96)83023-8","volume":"157","author":"J. West","year":"1996","unstructured":"West J. (1996). Generating trees and forbidden subsequences. Discrete Math. 157: 363\u2013374","journal-title":"Discrete Math."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-007-0053-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-007-0053-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-007-0053-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:54Z","timestamp":1558705314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-007-0053-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,29]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,8,2]]}},"alternative-id":["53"],"URL":"https:\/\/doi.org\/10.1007\/s00236-007-0053-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,29]]}}}