{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T19:58:24Z","timestamp":1718654304490},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":3394,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Advances in Applied Mathematics"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0196-8858(03)00057-5","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T23:03:18Z","timestamp":1054594998000},"page":"485-522","source":"Crossref","is-referenced-by-count":7,"title":["Uniform words"],"prefix":"10.1016","volume":"32","author":[{"given":"Arturo","family":"Carpi","sequence":"first","affiliation":[]},{"given":"Aldo","family":"de Luca","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0196-8858(03)00057-5_BIB001","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0304-3975(98)00248-5","article-title":"On the combinatorics of finite words","volume":"218","author":"de Luca","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-8858(03)00057-5_BIB002","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0304-3975(99)00334-5","article-title":"Words and special factors","volume":"259","author":"Carpi","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-8858(03)00057-5_BIB003","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1051\/ita:2002006","article-title":"On the distribution of characteristic parameters of words","volume":"36","author":"Carpi","year":"2002","journal-title":"Theoret. Informatics Appl."},{"key":"10.1016\/S0196-8858(03)00057-5_BIB004","unstructured":"A. Carpi, A. de Luca, Full and uniform sequences, Proc. Steklov Inst. Math., in press"},{"key":"10.1016\/S0196-8858(03)00057-5_BIB005","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s002360100079","article-title":"Words, univalent factors, and boxes","volume":"38","author":"Carpi","year":"2002","journal-title":"Acta Inform."},{"key":"10.1016\/S0196-8858(03)00057-5_BIB006","series-title":"Handbook of Formal Languages, vol. 2","first-page":"399","article-title":"Automata for matching patterns","author":"Crochemore","year":"1997"},{"key":"10.1016\/S0196-8858(03)00057-5_BIB007","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946","journal-title":"Nederl. Akad. Wetensch. Proc."},{"key":"10.1016\/S0196-8858(03)00057-5_BIB008","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1024041","article-title":"A survey of full length nonlinear shift register cycle algorithms","volume":"24","author":"Fredricksen","year":"1982","journal-title":"SIAM Rev."},{"key":"10.1016\/S0196-8858(03)00057-5_BIB009","series-title":"Concrete Mathematics. A Foundation for Computer Science","author":"Graham","year":"1994"},{"key":"10.1016\/S0196-8858(03)00057-5_BIB010","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01188580","article-title":"Combinatorial algorithms for DNA sequence assembly","volume":"13","author":"Kececioglu","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-8858(03)00057-5_BIB011","series-title":"Mathematical Foundations of Information Theory","author":"Khinchin","year":"1957"},{"key":"10.1016\/S0196-8858(03)00057-5_BIB012","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"24","author":"Lempel","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0196-8858(03)00057-5_BIB013","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511566097","article-title":"Combinatorics on Words","author":"Lothaire","year":"1997"},{"key":"10.1016\/S0196-8858(03)00057-5_BIB014","series-title":"Algebraic Combinatorics on Words","author":"Lothaire","year":"2002"},{"key":"10.1016\/S0196-8858(03)00057-5_BIB015","series-title":"Inequalities: Theory of Majorization and Its Applications","author":"Marshall","year":"1979"},{"key":"10.1016\/S0196-8858(03)00057-5_BIB016","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02988306","article-title":"On the maximum number of distinct factors of a binary string","volume":"9","author":"Shallit","year":"1993","journal-title":"Graphs Combin."}],"container-title":["Advances in Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885803000575?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196885803000575?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T18:06:40Z","timestamp":1656266800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196885803000575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0196885803000575"],"URL":"https:\/\/doi.org\/10.1016\/s0196-8858(03)00057-5","relation":{},"ISSN":["0196-8858"],"issn-type":[{"value":"0196-8858","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}