{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:42Z","timestamp":1761611142898},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"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":7929,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0890-5401(91)90016-u","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"76-95","source":"Crossref","is-referenced-by-count":21,"title":["Optimal canonization of all substrings of a string"],"prefix":"10.1016","volume":"95","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"M.","family":"Crochemore","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90016-U_BIB1","author":"Aho","year":"1974"},{"key":"10.1016\/0890-5401(91)90016-U_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0020-0190(78)90073-X","article-title":"An improved algorithmic check for polygon similarity","volume":"7","author":"Akl","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90016-U_BIB3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90016-U_BIB4","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","article-title":"Lexicographically least circular substrings","volume":"10","author":"Booth","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90016-U_BIB5","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\/0890-5401(91)90016-U_BIB6","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\/0890-5401(91)90016-U_BIB7","doi-asserted-by":"crossref","first-page":"322","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\/0890-5401(91)90016-U_BIB8","series-title":"Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison","year":"1985"},{"key":"10.1016\/0890-5401(91)90016-U_BIB9","author":"Lothaire","year":"1982"},{"key":"10.1016\/0890-5401(91)90016-U_BIB10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","article-title":"A linear time solution to the single function coarsest partition problem","volume":"40","author":"Paige","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90016-U_BIB11","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":"Shiloach","year":"1981","journal-title":"J. Algorithms"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190016U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190016U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:25:02Z","timestamp":1549045502000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190016U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["089054019190016U"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90016-u","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}