agreement subtree 1combinatorial bounds 1iterated exponential 1maximum agreement subtree 1phylogenetic trees 1unrooted binary trees 1
From the 1 of 3 linked papers with an AI index.
3 papers
math.CO2026
On Agreement Subtrees in Multiple Phylogenetic Trees
Bryan Currie, Ãva Czabarka, Mareike Fischer +3
The paper establishes new combinatorial bounds for the number of leaves required so that any k unrooted binary phylogenetic trees always share a common induced subtree, giving a fo…
math.CO2025
Reconstruction of caterpillar tanglegrams
Ann Clifton, Eva Czabarka, Kevin Liu +4
A tanglegram consists of two rooted binary trees with the same number of leaves and a perfect matching between the leaves of the trees. Given a size- tanglegram, i.e., a tangleg…
math.CO2025
Coconvex characters on collections of phylogenetic trees
Eva Czabarka, Steven Kelk, Vincent Moulton +1
In phylogenetics, a key problem is to construct evolutionary trees from collections of characters where, for a set X of species, a character is simply a function from X onto a set…