Unrooted trees for numerical taxonomy
From MaRDI portal
Cited in
(13)- Reconstructing the shape of a tree from observed dissimilarity data
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm
- Computational complexity of inferring phylogenies from dissimilarity matrices
- Free trees and bidirectional trees as representations of psychological distance
- Tree representations of ternary relations
- On some relations between 2-trees and tree metrics
- Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
- A parametric procedure for ultrametric tree estimation from conditional rank order proximity data
- The minimum evolution problem: Overview and classification
- Metric family portraits
- From Similarity to Distance: Axiom Set, Monotonic Transformations and Metric Determinacy
- The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms
This page was built for publication: Unrooted trees for numerical taxonomy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4404099)