A synopsis of comparative metrics for classifications

Bernardo Lopo Tavares

Home/Archive/arXiv

arXiv · 1804.03929

A synopsis of comparative metrics for classifications

Bernardo Lopo Tavares

View original source ↗Read source document ↗Export metadata ↓

Abstract

Phylogeny is the study of the relations between biological entities. From it, the need to compare tree-like graphs has risen and several metrics were established and researched, but since there is no definitive way to compare them, its discussion is still open nowadays. All of them emphasize different features of the structures and, of course, the efficiency of these computations also varies. The work in this article is mainly expositive (a lifting from a collection of papers and articles) with special care in its presentation (trying to mathematically formalize what was not presented that way previously) and filling (with original work) where information was not available (or at least, to our knowledge) given the frame we set to fit these metrics, which was to state their discriminative power and time complexity. The Robinson Foulds, Robinson Foulds Length, Quartet, Triplet, Triplet Length, Geodesic metrics are approached with greater detail (stating also some of its problems in formulation and discussing its intricacies) but the reader can also expect that less used (but not necessarily less important or less promising) metrics will be covered, which are Maximum Aggreement Subtree, Align, Cophenetic Correlation Coeficcient, Node, Similarity Based on Probability, Hybridization Number and Subtree Prune and Regraft. Finally, some challenges that sprouted from making this synopsys are presented as a possible subject of study and research.

Explore related subjects

cs.DS q-bio.QM

Keep this discovery

BibTeX RIS

Bernardo Lopo Tavares. 2018-04-11. A synopsis of comparative metrics for classifications. https://arxiv.org/abs/1804.03929

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

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗