Professor Magnus Bordewich m.j.r.bordewich@durham.ac.uk
Professor
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).
Bordewich, M., Semple, C., & Steel, M. (2006). Identifying X-Trees with Few Characters. Electronic Journal of Combinatorics, 13(1),
Journal Article Type | Article |
---|---|
Publication Date | Sep 28, 2006 |
Deposit Date | Jan 5, 2010 |
Publicly Available Date | Jan 6, 2010 |
Journal | Electronic Journal of Combinatorics |
Publisher | Electronic Journal of Combinatorics |
Peer Reviewed | Peer Reviewed |
Volume | 13 |
Issue | 1 |
Publisher URL | http://www.combinatorics.org/ojs/index.php/eljc/article/view/v13i1r83 |
Published Journal Article
(160 Kb)
PDF
Evaluating Gaussian Grasp Maps for Generative Grasping Models
(2022)
Conference Proceeding
On the Complexity of Optimising Variants of Phylogenetic Diversity on Phylogenetic Networks
(2022)
Journal Article
On the Maximum Agreement Subtree Conjecture for Balanced Trees
(2022)
Journal Article
Autoencoders Without Reconstruction for Textural Anomaly Detection
(2021)
Conference Proceeding
Improving Robotic Grasping on Monocular Images Via Multi-Task Learning and Positional Loss
(2021)
Conference Proceeding
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
Apache License Version 2.0 (http://www.apache.org/licenses/)
Apache License Version 2.0 (http://www.apache.org/licenses/)
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search