EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Spaces of ranked tree-child networks

Vincent Moulton, Andreas Spillner

Journal of Mathematical Biology · 2025

DOI: 10.1007/s00285-025-02265-2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Mathematical Biology, 2025. Verfasst von Vincent Moulton und 1 weiteren Autor:innen. Beteiligte Einrichtung: School of Computing Sciences, University of East Anglia, Norwich, UK. v.moulton@uea.ac.uk. Hauptthemen laut MEDLINE: Phylogeny, Models, Genetic, Biological Evolution. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Ranked tree-child networks are a recently introduced class of rooted phylogenetic networks in which the evolutionary events represented by the network are ordered so as to respect the flow of time. This class includes the well-studied ranked phylogenetic trees (also known as ranked genealogies). An important problem in phylogenetic analysis is to define distances between phylogenetic trees and networks in order to systematically compare them. Various distances have been defined on ranked binary phylogenetic trees, but very little is known about comparing ranked tree-child networks. In this paper, we introduce an approach to compare binary ranked tree-child networks on the same leaf set that is based on a new encoding of such networks that is given in terms of a certain partially ordered set. This allows us to define two new spaces of ranked binary tree-child networks. The first space can be considered as a generalization of the recently introduced space of ranked binary phylogenetic trees whose distance is defined in terms of ranked nearest neighbor interchange moves. The second space is a continuous space that captures all equidistant tree-child networks and generalizes the space of ultrametric trees. In particular, we show that this continuous space is a so-called CAT(0)-orthant space which, for example, implies that the distance between two equidistant tree-child networks can be efficiently computed.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

PhylogenyModels, GeneticBiological EvolutionMathematical ConceptsAlgorithmsHumansComputational BiologyEvolution, Molecular

Stichwörter der Autor:innen

CAT(0)-orthant spaceEquidistant networkNearest neighbor interchangeRanked phylogenetic network

Autor:innen und Institutionen

  • School of Computing Sciences, University of East Anglia, Norwich, UK. v.moulton@uea.ac.uk.
  • Merseburg University of Applied Sciences, Merseburg, Germany.

Zitieren

APA

Moulton, V., & Spillner, A. (2025). Spaces of ranked tree-child networks. Journal of Mathematical Biology. https://doi.org/10.1007/s00285-025-02265-2

Vancouver

Moulton V, Spillner A. Spaces of ranked tree-child networks. Journal of Mathematical Biology. 2025. doi:10.1007/s00285-025-02265-2

BibTeX
@article{Moulton2025,
  author = {Moulton, Vincent and Spillner, Andreas},
  title = {Spaces of ranked tree-child networks},
  journal = {Journal of Mathematical Biology},
  year = {2025},
  doi = {10.1007/s00285-025-02265-2}
}
Kostenlos starten →