Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Identifying X-trees with few characters.

Bordewich, M. and Semple, C. and Steel, M. A. (2006) 'Identifying X-trees with few characters.', The electronic journal of combinatorics., 13 (1). R83.

Abstract

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).

Item Type:Article
Full text:PDF - Published Version (157Kb)
Status:Peer-reviewed
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: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library