{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T14:02:42Z","timestamp":1772287362657,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8994,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0304-3975(88)90113-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"255-283","source":"Crossref","is-referenced-by-count":29,"title":["G\u00e9n\u00e9ration d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur born\u00e9e"],"prefix":"10.1016","volume":"60","author":[{"given":"Jean-Pierre","family":"Duval","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90113-2_BIB1","doi-asserted-by":"crossref","first-page":"240","DOI":"10.2307\/1970044","article-title":"Free differential calculus IV","volume":"68","author":"Chen","year":"1958","journal-title":"Ann. of Math."},{"key":"10.1016\/0304-3975(88)90113-2_BIB2","first-page":"15","article-title":"Algorithme de factorisation d'un mot en mots de Lyndon, dans","volume":"Tome 2","author":"Duval","year":"1978","journal-title":"Actes du Premier Colloque AFCET-SMF de Math\u00e9matiques Appliqu\u00e9es"},{"key":"10.1016\/0304-3975(88)90113-2_BIB3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1051\/ita\/1980140201811","article-title":"Mots de Lyndon et p\u00e9riodicit\u00e9","volume":"14","author":"Duval","year":"1980","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(88)90113-2_BIB4","first-page":"381","article-title":"Factorizing words over an ordered alphabet","volume":"4","author":"Duval","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(88)90113-2_BIB5","series-title":"Combinatorics on Words","author":"Lothaire","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901132?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901132?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:24Z","timestamp":1555127664000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0304397588901132"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90113-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}