Encoding and ordering X-cactuses

DOI10.1016/J.AAM.2022.102414zbMATH Open1500.92063arXiv2109.03183OpenAlexW4294443787MaRDI QIDQ2081908FDOQ2081908

Katharina T. Huber, Vincent Moulton, Andrew Francis, Taoyang Wu

Publication date: 30 September 2022

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: Phylogenetic networks are a generalization of evolutionary or phylogenetic trees that are commonly used to represent the evolution of species which cross with one another. A special type of phylogenetic network is an {em $X$-cactus}, which is essentially a cactus graph in which all vertices with degree less than three are labelled by at least one element from a set $X$ of species. In this paper, we present a way to {em encode} $X$-cactuses in terms of certain collections of partitions of $X$ that naturally arise from $X$-cactuses. Using this encoding, we also introduce a partial order on the set of $X$-cactuses (up to isomorphism), and derive some structural properties of the resulting partially ordered set. This includes an analysis of some properties of its least upper and greatest lower bounds. Our results not only extend some fundamental properties of phylogenetic trees to $X$-cactuses, but also provides a new approach to solving topical problems in phylogenetic network theory such as deriving consensus networks.

Full work available at URL: https://arxiv.org/abs/2109.03183

zbMATH Keywords

phylogenetic networkconsensus networktree ordering\(X\)-cactuspartition ordering

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Phylogeny. Discrete and random processes in evolution
• The Bergman complex of a matroid and phylogenetic trees
• Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations
• Transforming phylogenetic networks: moving beyond tree space
• On encodings of phylogenetic networks of bounded level
• Trees, taxonomy, and strongly compatible multi-state characters
• Shellability of complexes of trees
• A regular decomposition of the edge-product space of phylogenetic trees
• Uprooted phylogenetic networks
• Recognizing and realizing cactus metrics
• Split network polytopes and network spaces

Cited In (2)

• Labellable phylogenetic networks
• Phylogenetic network classes through the lens of expanding covers

This page was built for publication: Encoding and ordering \(X\)-cactuses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081908)