Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1909.05387

Tree congruence: quantifying similarity between dendrogram topologies

Steven U. Vidovic
View original source ↗Read source document ↗Export metadata ↓

Abstract

Tree congruence metrics are typically global indices that describe the similarity or dissimilarity between dendrograms. This study principally focuses on topological congruence metrics that quantify similarity between two dendrograms and can give a normalised score between 0 and 1. Specifically, this article describes and tests two metrics the Clade Retention Index (CRI) and the MASTxCF which is derived from the combined information available from a maximum agreement subtree and a strict consensus. The two metrics were developed to study differences between evolutionary trees, but their applications are multidisciplinary and can be used on hierarchical cluster diagrams derived from analyses in science, technology, maths or social sciences disciplines. A comprehensive, but non-exhaustive review of other tree congruence metrics is provided and nine metrics are further analysed. 1,620 pairwise analyses of simulated dendrograms (which could be derived from any type of analysis) were conducted and are compared in Pac-man piechart matrices. Kendalls tau-b is used to demonstrate the concordance of the different metrics and Spearmans rho ranked correlations are used to support these findings. The results support the use of the CRI and MASTxCF as part of a suite of metrics, but it is recommended that permutation metrics such as SPR distances and weighted metrics are disregarded for the specific purpose of measuring similarity.

Explore related subjects

math.GNq-bio.PEq-bio.QMstat.ME

Keep this discovery

BibTeXRIS

Steven U. Vidovic. 2019-09-11. Tree congruence: quantifying similarity between dendrogram topologies. https://arxiv.org/abs/1909.05387

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN↗
arXiv2026

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN↗
arXiv2026

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN↗