Unrooted trees for numerical taxonomy
From MaRDI portal
Publication:4404099
DOI10.2307/3212580zbMath0277.92004OpenAlexW2316678074MaRDI QIDQ4404099
Publication date: 1974
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3212580
Trees (05C05) Enumeration in graph theory (05C30) Combinatorial probability (60C05) General biology and biomathematics (92B05)
Related Items (13)
Computational complexity of inferring phylogenies from dissimilarity matrices ⋮ A parametric procedure for ultrametric tree estimation from conditional rank order proximity data ⋮ Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem ⋮ The compatibility of binary characters on phylogenetic networks: Complexity and parameterized algorithms ⋮ Reconstructing the shape of a tree from observed dissimilarity data ⋮ The minimum evolution problem: Overview and classification ⋮ Metric family portraits ⋮ Free trees and bidirectional trees as representations of psychological distance ⋮ Tree representations of ternary relations ⋮ On some relations between 2-trees and tree metrics ⋮ From Similarity to Distance: Axiom Set, Monotonic Transformations and Metric Determinacy ⋮ 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
This page was built for publication: Unrooted trees for numerical taxonomy
