Cover Image

A sharp lower bound for the number of phylogenetic trees displayed by a tree-child network

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Semple, Charles, Wicke, Kristina
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Populations and Evolution
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bounding the SNPR distance between two tree-child networks using generalised agreement forests
by: Kelk, Steven, et al.
Published: (2025)

Bounding the softwired parsimony score of a phylogenetic network
by: Döcker, Janosch, et al.
Published: (2024)

Order-Dependent Dissimilarity Measures on Phylogenetic Trees
by: Linz, Simone, et al.
Published: (2025)

Metaconcepts of rooted tree balance
by: Fischer, Mareike, et al.
Published: (2025)

The weighted total cophenetic index: A novel balance index for phylogenetic networks
by: Knüver, Linda, et al.
Published: (2023)

A height-based metaconcept for rooted tree balance and its implications for the $B_1$ index
by: Fischer, Mareike, et al.
Published: (2026)

Bounding the number of reticulation events for displaying multiple trees in a phylogenetic network
by: Wu, Yufeng, et al.
Published: (2024)

Defining a phylogenetic tree with the minimum number of small-state characters
by: Long, Yangjing, et al.
Published: (2025)

Characterising rooted and unrooted tree-child networks
by: Döcker, Janosch, et al.
Published: (2024)

Binary normal networks without near reticulations can be reconstructed from their rooted triples
by: Francis, Andrew, et al.
Published: (2025)

0-1 laws for pattern occurrences in phylogenetic trees and networks
by: Bienvenu, François, et al.
Published: (2024)

Coconvex characters on collections of phylogenetic trees
by: Czabarka, Eva, et al.
Published: (2025)

Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees
by: Huber, Katharina T., et al.
Published: (2022)

A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
by: Kelk, Steven, et al.
Published: (2026)

A complete characterization of pairs of binary phylogenetic trees with identical $A_k$-alignments
by: Wilde, Mirko, et al.
Published: (2024)

A $μ$-distance for semidirected orchard phylogenetic networks
by: Ribas, Gerard, et al.
Published: (2026)

Combinatorial comparison of general galled trees, time-consistent galled trees, and simplex time-consistent galled trees
by: Agranat-Tamir, Lily, et al.
Published: (2026)

Distinguishing Phylogenetic Level-2 Networks with Quartets and Inter-Taxon Quartet Distances
by: Holtgrefe, Niels, et al.
Published: (2025)

Characterizing semi-directed phylogenetic networks and their multi-rootable variants
by: Holtgrefe, Niels, et al.
Published: (2025)

Tree balance in phylogenetic models
by: Kersting, Sophie J., et al.
Published: (2024)

Metrics for classes of semi-binary phylogenetic networks using $μ$-representations
by: Reichling, Christopher, et al.
Published: (2024)

Counting cherry reduction sequences is counting linear extensions (in phylogenetic tree-child networks)
by: Coronado, Tomás M., et al.
Published: (2024)

Bounds on the sequence length sufficient to reconstruct binary level-$1$ phylogenetic networks under the CFN model
by: Frohn, Martin, et al.
Published: (2025)

Generalizing matrix representations to fully heterochronous ranked tree shapes
by: Jennings-Shaffer, Chris, et al.
Published: (2025)

Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
by: Agranat-Tamir, Lily, et al.
Published: (2025)

A strengthened bound on the number of states required to characterize maximum parsimony distance
by: Fischer, Mareike, et al.
Published: (2025)

Revealing the building blocks of tree balance: fundamental units of the Sackin and Colless Indices
by: Knüver, Linda, et al.
Published: (2025)

Counting rankings of tree-child networks
by: Zhang, Qiang, et al.
Published: (2025)

Counting spinal phylogenetic networks
by: Francis, Andrew, et al.
Published: (2025)

Perfect taxon sampling and fixing taxon traceability: Introducing a class of phylogenetically decisive collections of taxon sets
by: Fischer, Mareike, et al.
Published: (2012)

A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
by: Frohn, Martin, et al.
Published: (2024)

On the maximum value of the stairs2 index
by: Currie, Bryan, et al.
Published: (2024)

The space of multifurcating ranked tree shapes: enumeration, lattice structure, and Markov chains
by: Zhang, Julie, et al.
Published: (2025)

Embedding phylogenetic trees in networks of low treewidth
by: van Iersel, Leo, et al.
Published: (2022)

When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
by: Huber, Katharina T., et al.
Published: (2024)

A dissimilarity measure for semidirected networks
by: Maxfield, Michael, et al.
Published: (2024)

Spaces of ranked tree-child networks
by: Moulton, Vincent, et al.
Published: (2024)

Heat-tree: Cross-platform software for interactive and embeddable phylogenetic tree visualization and editing
by: Foster, Zachary S. L., et al.
Published: (2026)

Phylogenetic network classes through the lens of expanding covers
by: Francis, Andrew, et al.
Published: (2023)

On estimating the effective sample size of phylogenetic trees in an autocorrelated chain
by: Klawitter, Jonathan, et al.
Published: (2026)