{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T11:19:53Z","timestamp":1768735193621,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":3607,"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":[[2003,9]]},"DOI":"10.1016\/s0304-3975(03)00099-9","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T01:16:11Z","timestamp":1048641371000},"page":"173-178","source":"Crossref","is-referenced-by-count":22,"title":["Lyndon words, permutations and trees"],"prefix":"10.1016","volume":"307","author":[{"given":"Christophe","family":"Hohlweg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Reutenauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00099-9_BIB1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/1970044","article-title":"Free differential calculus IV. The quotient group of the lower central series","volume":"68","author":"Chen","year":"1958","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB2","unstructured":"M. Crochemore, T. Hancart, T. Lecroq, Algorithmique du texte, Vuibert, 2001."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0097-3165(75)90002-3","article-title":"Alternating permutations and binary increasing trees","volume":"18","author":"Donaghey","year":"1975","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0304-3975(03)00099-9_BIB4","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\/S0304-3975(03)00099-9_BIB5","unstructured":"D. Foata, M.-P. Sch\u00fctzenberger, Nombres d'Euler et permutations alternantes, University of Florida, Gainesville, Department of Mathematics, 1971, preprint."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB6","first-page":"37","article-title":"Arbres binaires de recherche","volume":"10","author":"Fran\u00e7on","year":"1976","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0097-3165(93)90095-P","article-title":"Counting permutations with given cycle structure and descent set","volume":"64","author":"Gessel","year":"1993","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0304-3975(03)00099-9_BIB8","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0020-0190(77)90035-7","article-title":"Sorting tree, nestling tree and inverse permutation","volume":"6","author":"Kundu","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB9","doi-asserted-by":"crossref","unstructured":"M. Lothaire, Combinatorics on Words, 2nd Ed., Addison-Wesley, Reading, MA, 1983; Cambridge University Press, Cambridge, 1997.","DOI":"10.1017\/CBO9780511566097"},{"key":"10.1016\/S0304-3975(03)00099-9_BIB10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0097-3165(92)90070-B","article-title":"Combinatorics of Hall trees and Hall words","volume":"59","author":"Melan\u00e7on","year":"1992","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0304-3975(03)00099-9_BIB12","doi-asserted-by":"crossref","first-page":"577","DOI":"10.4153\/CJM-1989-025-2","article-title":"Lyndon words, free algebras and shuffles","volume":"41","author":"Melan\u00e7on","year":"1989","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.4153\/CJM-1961-015-3","article-title":"Longest increasing and decreasing subsequences","volume":"13","author":"Schensted","year":"1961","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB14","unstructured":"M.-P. Sch\u00fctzenberger, Sur une propri\u00e9t\u00e9 combinatoire des alg\u00e8bres de lie libres pouvant \u00eatre utilis\u00e9e dans un probl\u00e8me de math\u00e9matiques appliqu\u00e9es, S\u00e9minaire P. Dubreil, Paris, Facult\u00e9 des Sciences, 1958."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB15","series-title":"An Introduction to the Analysis of Algorithms","author":"Sedgewick","year":"1996"},{"key":"10.1016\/S0304-3975(03)00099-9_BIB16","doi-asserted-by":"crossref","unstructured":"R. Stanley, Enumerative Combinatorics, Vol. A, Wadsworth and Brooks\/Cole, 1986.","DOI":"10.1007\/978-1-4615-9763-6_1"},{"key":"10.1016\/S0304-3975(03)00099-9_BIB17","unstructured":"G. Viennot, Quelques algorithmes de permutation, in: Journ\u00e9es algorithmiques, Paris, Society for Mathematics of France, Ast\u00e9risque, 1976, pp. 38\u201339, pp. 275\u2013293."},{"key":"10.1016\/S0304-3975(03)00099-9_BIB18","doi-asserted-by":"crossref","unstructured":"J. Vuillemin, A unifying look at data structures, Comm. ACM 23, 1980, pp. 229\u2013239.","DOI":"10.1145\/358841.358852"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000999?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503000999?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:28:31Z","timestamp":1553671711000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503000999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0304397503000999"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00099-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}