What the study found
The study shows that labeled histories can be enumerated for rooted leaf-labeled trees with at most r offspring per internal node, where internal nodes may have between 2 and r children. It also shows that, for n or more leaves, the maximally probable at-most-r-furcating unlabeled topology is the same as the maximally probable strictly bifurcating unlabeled topology.
Why the authors say this matters
The authors state that these computations contribute to the study of multifurcation, which arises in various biological processes. They also note that the work connects to analogous mathematical settings involving precedence-constrained scheduling.
What the researchers tested
The researchers studied labeled histories for at-most-r-furcating trees in mathematical phylogenetics, where labeled histories describe sequences in which labeled lineages coalesce into a shared ancestral lineage. They enumerated the total number of labeled histories for labeled topologies with n leaves, and they also considered a setting that permits simultaneous branchings.
What worked and what didn't
They enumerated the labeled histories for a specific at-most-r-furcating labeled topology. They showed that the maximally probable at-most-r-furcating unlabeled topology on n ≥ 2 leaves reduces to the strictly bifurcating case, and they similarly reduced the version allowing simultaneity to the corresponding strictly bifurcating problem. For the simultaneous-branching case, they conjecture the shape of the bifurcating unlabeled topology.
What to keep in mind
The abstract does not describe experimental limits or empirical validation. It also does not provide the conjectured shape itself, only that a conjecture is made.
Key points
- The paper counts labeled histories for trees with at most r offspring per internal node.
- The maximally probable at-most-r-furcating unlabeled topology reduces to the strictly bifurcating case.
- The authors also treat a version that allows simultaneous branchings.
- For the simultaneity setting, they reduce the unlabeled-topology problem to the strictly bifurcating version and make a conjecture about its shape.
- The authors say the work relates to multifurcation in biology and to precedence-constrained scheduling.
Disclosure
- Research title:
- Labeled histories are enumerated for multifurcating trees
- Image credit:
- Photo by Sangharsh Lohakare on Unsplash
Get the weekly research newsletter
Stay current with peer-reviewed research without reading academic papers — one filtered digest, every Friday.