{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:45:52Z","timestamp":1764557152512},"reference-count":17,"publisher":"Elsevier BV","issue":"15","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"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":2542,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1016\/j.disc.2006.03.044","type":"journal-article","created":{"date-parts":[[2006,6,13]],"date-time":"2006-06-13T14:20:58Z","timestamp":1150208458000},"page":"1732-1741","source":"Crossref","is-referenced-by-count":6,"title":["Ordered trees and the inorder traversal"],"prefix":"10.1016","volume":"306","author":[{"given":"A.","family":"Sapounakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Tasoulas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Tsikouras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2006.03.044_bib1","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1093\/comjnl\/36.6.593","article-title":"Uniform generation of rooted ordered trees with prescribed degrees","volume":"36","author":"Atkinson","year":"1993","journal-title":"Comput. J."},{"key":"10.1016\/j.disc.2006.03.044_bib2","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1006\/eujc.1996.0051","article-title":"A new bijection between ordered trees and legal bracketings","volume":"17","author":"Benchekroun","year":"1996","journal-title":"European J. Combin."},{"key":"10.1016\/j.disc.2006.03.044_bib3","first-page":"35","article-title":"Some q-analogues of the Schr\u00f6der numbers arising from combinatorial statistics on lattice paths","volume":"34","author":"Bonin","year":"1993","journal-title":"J. Statist. Inform."},{"key":"10.1016\/j.disc.2006.03.044_bib4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0012-365X(80)90168-5","article-title":"Enumerations of ordered trees","volume":"31","author":"Dershowitz","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.03.044_bib5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0012-365X(98)00371-9","article-title":"Dyck path enumeration","volume":"204","author":"Deutsch","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.03.044_bib6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.disc.2003.10.021","article-title":"Ordered trees with prescribed root degrees, node degrees, and branch lengths","volume":"282","author":"Deutsch","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.03.044_bib7","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/S0012-365X(02)00341-2","article-title":"A bijection between ordered trees and 2-Motzkin paths and its many consequences","volume":"256","author":"Deutsch","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.03.044_bib8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0095-8956(77)90003-X","article-title":"Restricted plane tree representations of four Motzkin\u2013Catalan equations","volume":"22","author":"Donaghey","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.disc.2006.03.044_bib9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0097-3165(77)90020-6","article-title":"Motzkin numbers","volume":"23","author":"Donaghey","year":"1977","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.disc.2006.03.044_bib10","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/S0021-9800(70)80093-X","article-title":"Correspondences between plane trees and binary sequences","volume":"9","author":"Klarner","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/j.disc.2006.03.044_bib11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0012-365X(97)00164-7","article-title":"On numbers of Davenport\u2013Schinzel sequences","volume":"185","author":"Klazar","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.03.044_bib12","volume":"vol. 1.","author":"Knuth","year":"1997"},{"key":"10.1016\/j.disc.2006.03.044_bib13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1006\/jagm.1999.1059","article-title":"Multiset permutations and loopless generation of ordered trees with specified degree sequence","volume":"34","author":"Korsh","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/j.disc.2006.03.044_bib14","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/comjnl\/45.3.364","article-title":"Loopless generation of trees with specified degrees","volume":"45","author":"Korsh","year":"2002","journal-title":"Comput. J."},{"key":"10.1016\/j.disc.2006.03.044_bib15","series-title":"Combinatorial Identities","author":"Riordan","year":"1968"},{"key":"10.1016\/j.disc.2006.03.044_bib16","unstructured":"N.J.A. Sloane, The On-Line Encyclopedia of Integer Sequences (2005), published electronically at \u3008http:\/\/www.research.att.com\/\u223cnjas\/sequences\/\u3009."},{"key":"10.1016\/j.disc.2006.03.044_bib17","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01952690","article-title":"Efficient algorithms for tree reconstruction","volume":"29","author":"Slough","year":"1989","journal-title":"BIT"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X06002445?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X06002445?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,15]],"date-time":"2019-01-15T20:58:37Z","timestamp":1547585917000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X06002445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":17,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["S0012365X06002445"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2006.03.044","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}