EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Branch Length Transforms using Optimal Tree Metric Matching

Shayesteh Arasti, Puoya Tabaghi, Yasamin Tabatabaee, Alan K Mayer, Siavash Mirarab iD

Systematic Biology · 10.03.2026

DOI: 10.1093/sysbio/syag025 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Systematic Biology, online erschienen am 10.03.2026. Verfasst von Shayesteh Arasti und 4 weiteren Autor:innen. Beteiligte Einrichtung: Department of Computer Science and Engineering, UC San Diego, CA 92093, USA. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 68 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: NIGMS NIH HHS, National Institutes of Health.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The abundant discordance between evolutionary relationships across the genome has rekindled interest in methods for comparing and averaging trees on a shared leaf set. However, compared to tree topology, where much progress has been made, handling branch lengths has been more challenging. Species tree branch lengths can be measured in various units, often different from gene trees. Moreover, rates of evolution change across the genome, the species tree, and specific branches of gene trees. These factors compound the stochasticity of coalescence times and estimation noise, making branch lengths highly heterogeneous across the genome. For many downstream applications in phylogenomic analyses, branch lengths are as important as the topology, and yet, existing tools to compare and combine weighted trees are limited. In this paper, we address the question of matching one tree to another, accounting for their branch lengths. We define a series of computational problems called Topology-Constrained Metric Matching (TCMM) that seek to transform the branch lengths of a query tree based on a reference tree. We show that TCMM problems can be solved efficiently using a linear algebraic formulation coupled with dynamic programming preprocessing. While many applications can be imagined for this framework, we explore two applications in this paper: embedding leaves of gene trees in Euclidean space to find outliers potentially indicative of estimation errors, and summarizing gene tree branch lengths onto the species tree. In these applications, our method, when paired with existing methods, increases their accuracy at limited computational expense.

Schlagwörter

Stichwörter der Autor:innen

Convex OptimizationDistance-based phylogeneticsOutlier DetectionPhylogenomicsSpecies Tree Branch Length

Autor:innen und Institutionen

  • Department of Computer Science and Engineering, UC San Diego, CA 92093, USA.
  • Halicioğlu Data Science Institute, UC San Diego, CA 92093, USA.
  • Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA.
  • Department of Mathematics, UC San Diego, CA 92093, USA.
  • Department of Electrical and Computer Engineering, UC San Diego, CA 92093, USA.

ORCID-Profile: Siavash Mirarab

Förderung

  • NIGMS NIH HHS
  • National Institutes of Health

Zitieren

APA

Arasti, S., Tabaghi, P., Tabatabaee, Y., Mayer, A. K., & Mirarab, S. (2026). Branch Length Transforms using Optimal Tree Metric Matching. Systematic Biology. https://doi.org/10.1093/sysbio/syag025

Vancouver

Arasti S, Tabaghi P, Tabatabaee Y, Mayer AK, Mirarab S. Branch Length Transforms using Optimal Tree Metric Matching. Systematic Biology. 2026. doi:10.1093/sysbio/syag025

BibTeX
@article{Arasti2026,
  author = {Arasti, Shayesteh and Tabaghi, Puoya and Tabatabaee, Yasamin and Mayer, Alan K and Mirarab, Siavash},
  title = {Branch Length Transforms using Optimal Tree Metric Matching},
  journal = {Systematic Biology},
  year = {2026},
  doi = {10.1093/sysbio/syag025}
}
Kostenlos starten →