On distances between phylogenetic trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Direct Construction of Compact Directed Acyclic Word Graphs
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
Pattern Identification in Biogeography
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A Tree Distance Function Based on Multi-sets
New Frontiers in Applied Data Mining
Metrics for Phylogenetic Networks I: Generalizations of the Robinson-Foulds Metric
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing the Distribution of a Tree Metric
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On Nakhleh's Metric for Reduced Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
MMDT: a multi-valued and multi-labeled decision tree classifier for data mining
Expert Systems with Applications: An International Journal
A Metric on the Space of Reduced Phylogenetic Networks
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
RIATA-HGT: a fast and accurate heuristic for reconstructing horizontal gene transfer
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Algorithms for building consensus MUL-trees
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Extracting conflict-free information from multi-labeled trees
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
Multilabeled trees or MUL-trees, for short, are trees whose leaves are labeled by elements of some nonempty finite set X such that more than one leaf may be labeled by the same element of X. This class of trees includes phylogenetic trees and tree shapes. MUL-trees arise naturally in, for example, biogeography and gene evolution studies and also in the area of phylogenetic network reconstruction. In this paper, we introduce novel metrics which may be used to compare MUL-trees, most of which generalize well-known metrics on phylogenetic trees and tree shapes. These metrics can be used, for example, to better understand the space of MUL-trees or to help visualize collections of MUL-trees. In addition, we describe some relationships between the MUL-tree metrics that we present and also give some novel diameter bounds for these metrics. We conclude by briefly discussing some open problems as well as pointing out how MUL-tree metrics may be used to define metrics on the space of phylogenetic networks.