{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:02Z","timestamp":1761611102486},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0196-6774(02)00286-9","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T18:57:26Z","timestamp":1045508246000},"page":"21-26","source":"Crossref","is-referenced-by-count":4,"title":["Generating Lyndon brackets."],"prefix":"10.1016","volume":"46","author":[{"given":"J.","family":"Sawada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Ruskey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(02)00286-9_BIB001","doi-asserted-by":"crossref","first-page":"101","DOI":"10.46298\/dmtcs.236","article-title":"Finely homogeneous computations in free Lie algebras","volume":"1","author":"Andary","year":"1997","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"2","key":"10.1016\/S0196-6774(02)00286-9_BIB002","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1006\/jagm.2000.1108","article-title":"Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2)","volume":"37","author":"Cattell","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00286-9_BIB003","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","article-title":"Factorizing words over an ordered alphabet","volume":"4","author":"Duval","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00286-9_BIB004","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0196-6774(02)00286-9_BIB005","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1098\/rsta.1999.0361","article-title":"Computations in a free Lie algebra","volume":"357","author":"Munthe-Kaas","year":"1999","journal-title":"Philos. Trans. Roy. Soc. London Ser. A"},{"key":"10.1016\/S0196-6774(02)00286-9_BIB006","series-title":"Free Lie Algebras","author":"Reutenauer","year":"1993"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002869?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002869?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T18:26:23Z","timestamp":1682447183000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677402002869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0196677402002869"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(02)00286-9","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}