{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:25:40Z","timestamp":1776288340253,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"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":[[1983,12]]},"DOI":"10.1016\/0196-6774(83)90017-2","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"363-381","source":"Crossref","is-referenced-by-count":166,"title":["Factorizing words over an ordered alphabet"],"prefix":"10.1016","volume":"4","author":[{"given":"Jean","family":"Pierre Duval","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(83)90017-2_BIB1","first-page":"329","article-title":"The Design and Analysis of Computer Algorithm","author":"Aho","year":"1974"},{"issue":"4\u20135","key":"10.1016\/0196-6774(83)90017-2_BIB2","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","article-title":"Lexicographically least circular substring","volume":"10","author":"Booth","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(83)90017-2_BIB3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/1970044","article-title":"Free differential calculus, IV","volume":"68","author":"Chen","year":"1958","journal-title":"Ann. of Math."},{"key":"10.1016\/0196-6774(83)90017-2_BIB4","first-page":"15","article-title":"Algorithme de factorisation d'un mot en mots de Lyndon","volume":"tome 2","author":"Duval","year":"1978","journal-title":"Actes du premier colloque AFCET-SMF de Math\u00e9matiques appliqu\u00e9es"},{"issue":"2","key":"10.1016\/0196-6774(83)90017-2_BIB5","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."},{"issue":"2","key":"10.1016\/0196-6774(83)90017-2_BIB6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(83)90017-2_BIB7","series-title":"Combinatorics on Words","author":"Lothaire","year":"1982"},{"key":"10.1016\/0196-6774(83)90017-2_BIB8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0196-6774(81)90013-4","article-title":"Fast canonization of circular strings","volume":"2","author":"Siloach","year":"1981","journal-title":"J. Algorithms"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900172?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677483900172?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:50:53Z","timestamp":1548744653000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677483900172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0196677483900172"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(83)90017-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}