Affine and projective tree metric theorems
From MaRDI portal
Publication:1950414
DOI10.1007/s00026-012-0173-2zbMath1263.05013arXiv1103.2384OpenAlexW2086156541MaRDI QIDQ1950414
Matan Harel, Lior Pachter, Aaron Kleinman
Publication date: 13 May 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.2384
pyramidhierarchyultrametricphylogeneticsGromov productPQ-treeKalmanson metricPC-treeRobinsonian metric
Trees (05C05) Taxonomy, cladistics, statistics in mathematical biology (92B10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Circular Planar Electrical Networks, Split Systems, and Phylogenetic Networks ⋮ Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem ⋮ Uprooted phylogenetic networks ⋮ Galois connections for phylogenetic networks and their polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The neighbor-net algorithm
- Some uses of the Farris transform in mathematics and phylogenetics -- A review
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A note on circular decomposable metrics
- PC trees and circular-ones arrangements.
- Pyramids and weak hierarchies in the ordinal model for clustering
- Cyclic permutations and evolutionary trees
- A new planarity test
- The structure and construction of taxonomic hierarchies
- The structure of circular decomposable metrics
- Algebraic Statistics for Computational Biology
- Efficient algorithms for inferring evolutionary trees
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: Affine and projective tree metric theorems