{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T05:57:47Z","timestamp":1768715867037,"version":"3.49.0"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,2,1]],"date-time":"2017-02-01T00:00:00Z","timestamp":1485907200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["Z1-5434"],"award-info":[{"award-number":["Z1-5434"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1101017"],"award-info":[{"award-number":["DMS-1101017"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["BI-US\/14-15-026"],"award-info":[{"award-number":["BI-US\/14-15-026"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["CISE-1564137"],"award-info":[{"award-number":["CISE-1564137"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["DMS-1223057"],"award-info":[{"award-number":["DMS-1223057"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1016\/j.jcta.2016.10.003","type":"journal-article","created":{"date-parts":[[2016,10,24]],"date-time":"2016-10-24T17:00:37Z","timestamp":1477328437000},"page":"239-263","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"special_numbering":"C","title":["On the enumeration of tanglegrams and tangled chains"],"prefix":"10.1016","volume":"146","author":[{"given":"Sara C.","family":"Billey","sequence":"first","affiliation":[]},{"given":"Matja\u017e","family":"Konvalinka","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-0607-6025","authenticated-orcid":false,"suffix":"IV","given":"Frederick A.","family":"Matsen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcta.2016.10.003_br0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","article-title":"Subtree transfer operations and their induced metrics on evolutionary trees","volume":"5","author":"Allen","year":"2001","journal-title":"Ann. Comb."},{"key":"10.1016\/j.jcta.2016.10.003_br0020","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s00453-010-9456-3","article-title":"Drawing (complete) binary tanglegrams: hardness, approximation, fixed-parameter tractability","volume":"62","author":"Buchin","year":"2012","journal-title":"Algorithmica"},{"key":"10.1016\/j.jcta.2016.10.003_br0030","series-title":"The Evolution of Parasitism-A Phylogenetic Perspective","first-page":"303","article-title":"Recent results in cophylogeny mapping","volume":"vol. 54","author":"Charleston","year":"2003"},{"key":"10.1016\/j.jcta.2016.10.003_br0040","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0097-3165(78)90068-7","article-title":"The number of Baxter permutations","volume":"24","author":"Chung","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.jcta.2016.10.003_br0050","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(86)90018-X","article-title":"Shuffle of parenthesis systems and Baxter permutations","volume":"43","author":"Cori","year":"1986","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.jcta.2016.10.003_br0060","doi-asserted-by":"crossref","unstructured":"\u00c9. Czabarka, L.A. Sz\u00e9kely, S. Wagner, Inducibility in binary trees and crossings in random tanglegrams, 2016, arXiv e-prints.","DOI":"10.1137\/16M1060741"},{"key":"10.1016\/j.jcta.2016.10.003_br0070","doi-asserted-by":"crossref","first-page":"14600","DOI":"10.1073\/pnas.95.25.14600","article-title":"Matchings and phylogenetic trees","volume":"95","author":"Diaconis","year":"1998","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.jcta.2016.10.003_br0080","article-title":"Permutations de Baxter","volume":"33","author":"Dulucq","year":"1994","journal-title":"S\u00e9m. Lothar. Combin."},{"key":"10.1016\/j.jcta.2016.10.003_br0090","series-title":"Proceedings of the 6th Conference on Formal Power Series and Algebraic Combinatorics","first-page":"91","article-title":"Stack words, standard tableaux and Baxter permutations","volume":"vol. 157","author":"Dulucq","year":"1996"},{"key":"10.1016\/j.jcta.2016.10.003_br0100","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01890123","article-title":"The generation of random, binary unordered trees","volume":"1","author":"Furnas","year":"1984","journal-title":"J. Classification"},{"key":"10.1016\/j.jcta.2016.10.003_br0110","doi-asserted-by":"crossref","DOI":"10.37236\/5994","article-title":"On symmetries in phylogenetic trees","volume":"23","author":"Fusy","year":"2016","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.jcta.2016.10.003_br0120","unstructured":"I. Gessel, The Konvalinka\u2013Amdeberhan conjecture and plethystic inverses, in preparation."},{"key":"10.1016\/j.jcta.2016.10.003_br0130","unstructured":"I.M. Gessel, Counting tanglegrams with species, arXiv e-prints, 2015."},{"key":"10.1016\/j.jcta.2016.10.003_br0140","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1038\/332258a0","article-title":"Phylogenetic trees support the coevolution of parasites and their hosts","volume":"332","author":"Hafner","year":"1988","journal-title":"Nature"},{"key":"10.1016\/j.jcta.2016.10.003_br0150","series-title":"Topics in Algebra","author":"Herstein","year":"1975"},{"key":"10.1016\/j.jcta.2016.10.003_br0160","first-page":"185","article-title":"Sur les assemblages de lignes","author":"Jordan","year":"1869","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/j.jcta.2016.10.003_br0170","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1080\/00150517.1966.12431371","article-title":"Correction: \u201cAn almost linear recurrence\u201d","volume":"4","author":"Knuth","year":"1966","journal-title":"Fibonacci Quart."},{"key":"10.1016\/j.jcta.2016.10.003_br0180","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.jcta.2013.11.008","article-title":"Cayley compositions, partitions, polytopes, and geometric bijections","volume":"123","author":"Konvalinka","year":"2014","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.jcta.2016.10.003_br0190","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.aam.2016.04.001","article-title":"The shape of random tanglegrams","volume":"78","author":"Konvalinka","year":"2016","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/j.jcta.2016.10.003_br0200","article-title":"Tanglegrams: a reduction tool for mathematical phylogenetics","author":"Matsen","year":"2016","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"10.1016\/j.jcta.2016.10.003_br0210","author":"OEIS Foundation Inc."},{"key":"10.1016\/j.jcta.2016.10.003_br0220","series-title":"Tangled Trees: Phylogeny, Cospeciation, and Coevolution","author":"Page","year":"2003"},{"key":"10.1016\/j.jcta.2016.10.003_br0230","year":"2011"},{"key":"10.1016\/j.jcta.2016.10.003_br0240","doi-asserted-by":"crossref","first-page":"i248","DOI":"10.1093\/bioinformatics\/btr210","article-title":"Tanglegrams for rooted phylogenetic trees and networks","volume":"27","author":"Scornavacca","year":"2011","journal-title":"Bioinformatics"},{"key":"10.1016\/j.jcta.2016.10.003_br0250","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.disc.2004.11.014","article-title":"On non-squashing partitions","volume":"294","author":"Sloane","year":"2005","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2016.10.003_br0260","article-title":"Enumerative Combinatorics, vol. 1","volume":"vol. 49","author":"Stanley","year":"1997"},{"key":"10.1016\/j.jcta.2016.10.003_br0270","article-title":"A bijective proof for the number of Baxter permutations","author":"Viennot","year":"1981","journal-title":"S\u00e9m. Lothar. Combin."},{"key":"10.1016\/j.jcta.2016.10.003_br0280","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1093\/sysbio\/syu023","article-title":"Supertrees based on the subtree prune-and-regraft distance","volume":"63","author":"Whidden","year":"2014","journal-title":"Syst. Biol."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0097316516301029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0097316516301029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T20:34:18Z","timestamp":1749674058000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316516301029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":28,"alternative-id":["S0097316516301029"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jcta.2016.10.003","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2017,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the enumeration of tanglegrams and tangled chains","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jcta.2016.10.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Inc.","name":"copyright","label":"Copyright"}]}}