{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T15:08:11Z","timestamp":1761923291839,"version":"build-2065373602"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":7868,"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":[[1992,1]]},"DOI":"10.1016\/0304-3975(92)90137-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"87-105","source":"Crossref","is-referenced-by-count":15,"title":["Optimal algorithms for computing the canonical form of a circular string"],"prefix":"10.1016","volume":"92","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]},{"given":"W.F.","family":"Smyth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0304-3975(92)90137-5_BIB1","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."},{"year":"1989","series-title":"Fast parallel Lyndon factorization with applications","author":"Apostolico","key":"10.1016\/0304-3975(92)90137-5_BIB2"},{"key":"10.1016\/0304-3975(92)90137-5_BIB3","unstructured":"A. Apostolico and C. Iliopoulos, Unpublished manuscript."},{"key":"10.1016\/0304-3975(92)90137-5_BIB4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","article-title":"Parallel construction of a suffix tree with applications","volume":"3","author":"Apostolico","year":"1988","journal-title":"Acta Algorithmica"},{"key":"10.1016\/0304-3975(92)90137-5_BIB5","series-title":"Proc. Int. Conf. on Parallel architectures","first-page":"70","article-title":"An O(n log n) cost parallel algorithm for the one function partitioning problem","author":"Apostolico","year":"1987"},{"issue":"4","key":"10.1016\/0304-3975(92)90137-5_BIB6","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\/0304-3975(92)90137-5_BIB7","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\/0304-3975(92)90137-5_BIB8","series-title":"Proc. 16th ACM symp. on Theory of Computing","first-page":"240","article-title":"Optimal parallel algorithms for string matching","author":"Galil","year":"1984"},{"key":"10.1016\/0304-3975(92)90137-5_BIB9","unstructured":"C.S. Iliopoulos and W.F. Smyth, A new sequential algorithm for canonization of circular strings, submitted."},{"issue":"2","key":"10.1016\/0304-3975(92)90137-5_BIB10","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\/0304-3975(92)90137-5_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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901375?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:56:36Z","timestamp":1555127796000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592901375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0304397592901375"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90137-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}