{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:42:57Z","timestamp":1753893777815,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree ${\\cal T}$, there is a set of four characters that define ${\\cal T}$. Here we deal with the general case, where ${\\cal T}$ is an arbitrary $X$-tree. We show that if $d$ is the maximum degree of any vertex in ${\\cal T}$, then the minimum number of characters that identify ${\\cal T}$ is $\\log_2 d$ (up to a small multiplicative constant).<\/jats:p>","DOI":"10.37236\/1109","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T04:56:47Z","timestamp":1578718607000},"source":"Crossref","is-referenced-by-count":1,"title":["Identifying $X$-Trees with Few Characters"],"prefix":"10.37236","volume":"13","author":[{"given":"Magnus","family":"Bordewich","sequence":"first","affiliation":[]},{"given":"Charles","family":"Semple","sequence":"additional","affiliation":[]},{"given":"Mike","family":"Steel","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2006,9,28]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v13i1r83\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v13i1r83\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T04:07:44Z","timestamp":1579320464000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v13i1r83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,28]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2006,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/1109","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2006,9,28]]},"article-number":"R83"}}