Bordewich, M. and Semple, C. and Steel, M. A. (2006) 'Identifying X-trees with few characters.', The electronic journal of combinatorics., 13 (1). R83.
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T, there is a set of four characters that define T. Here we deal with the general case, where T is an arbitrary X-tree. We show that if d is the maximum degree of any vertex in T, then the minimum number of characters that identify T is log2d (up to a small multiplicative constant).
|Full text:||PDF - Published Version (157Kb)|
|Publisher Web site:||http://www.combinatorics.org/ojs/index.php/eljc/article/view/v13i1r83|
|Record Created:||05 Jan 2010 10:05|
|Last Modified:||23 Jul 2015 14:49|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|