Outputs (3)

Identifying X-Trees with Few Characters (2006)
Journal Article
Bordewich, M., Semple, C., & Steel, M. (2006). Identifying X-Trees with Few Characters. Electronic Journal of Combinatorics, 13(1),

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 degr... Read More about Identifying X-Trees with Few Characters.

Stopping times, metrics and approximate counting (2006)
Conference Proceeding
Bordewich, M., Dyer, M., & Karpinski, M. (2006). Stopping times, metrics and approximate counting. In M. Bugliesi, B. Preneel, V. Sassone, & I. Wegener (Eds.), Automata, languages and programming : 33rd International Colloquium, ICALP 2006, 10-14 July 2006, Venice, Italy ; proceedings, part I (108-119). https://doi.org/10.1007/11786986_11

In this paper we examine the importance of the choice of metric in path coupling, and its relationship to stopping time analysis. We give strong evidence that stopping time analysis is no more powerful than standard path coupling. In particular, we p... Read More about Stopping times, metrics and approximate counting.

Extending the limits of supertree methods (2006)
Journal Article
Bordewich, M., Evans, G., & Semple, C. (2006). Extending the limits of supertree methods. Annals of Combinatorics, 10, 31-51

Recently, two exact polynomial-time supertree methods have been developed in which the traditional input of rooted leaf-labelled trees has been extended in two separate ways. The first method, called RANKEDTREE, allows for the inclusion of relative d... Read More about Extending the limits of supertree methods.