SOTAVerified

Highly-Efficient Robinson-Foulds Distance Estimation with Matrix Correction

2023-10-0426th European Conference on Artificial Intelligence 2023Code Available0· sign in to hype

Fangchen Yu, Rui Bao, Jianfeng Mao, Wenye Li

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Phylogenetic trees are essential in studying evolutionary relationships, and the Robinson-Foulds (RF) distance is a widely used metric to calculate pairwise dissimilarities between phylogenetic trees, with various applications in both the biology and computing communities. However, generating a precise RF distance matrix becomes difficult or even intractable when tree information is partially missing. To address this issue, we introduce a novel distance correction algorithm for estimating the RF distance matrix of incomplete phylogenetic trees. Our method innovatively harnesses the assumption of Euclidean embedding, correcting an approximate distance matrix into a valid distance metric, guaranteed to be closer to the unknown ground-truth. Despite its simplicity, our approach exhibits robust performance, efficiency, and scalability in empirical evaluations, outperforming classical distance correction algorithms and holding potential benefits in downstream applications. Our code is available at https://github.com/CUHKSZ-Yu/EMC.

Tasks

Reproductions