Generalizing Matrix Representations to Fully Heterochronous Ranked Tree Shapes
Bulletin of Mathematical Biology · 2026-05 · 88 (5)
DOI: 10.1007/s11538-026-01632-4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bulletin of Mathematical Biology, online erschienen am 12.05.2026. Verfasst von Chris Jennings-Shaffer und 3 weiteren Autor:innen. Beteiligte Einrichtung: Fred Hutchinson Cancer Research Center, Seattle, Washington, USA. Hauptthemen laut MEDLINE: Phylogeny, Models, Genetic, Biological Evolution. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Institute of Allergy and Infectious Diseases, NIH HHS, NIAID NIH HHS.
Abstract (Originalsprache)
Phylogenetic tree shapes capture fundamental signatures of evolution. We consider “ranked” tree shapes, which are equipped with a total order on the internal nodes compatible with the tree graph. Recent work has established an elegant bijection between ranked tree shapes and a class of integer matrices, called F -matrices, defined by simple inequalities. This formulation is for isochronous ranked tree shapes, where all leaves share the same sampling time, such as in the study of ancient human demography from present-day individuals. However, branch lengths of phylogenetic trees can represent units other than calendar time, such as evolutionary distance. A tree equipped with branch lengths quantifying evolutionary distance, called a rooted phylogram, is output by popular maximum-likelihood methods. These trees are broadly relevant, such as to study the affinity maturation of B cells in the immune system. Discretizing time in a rooted phylogram gives a fully heterochronous ranked tree shape, where leaves are part of the total order. Here we extend the F -matrix framework to such fully heterochronous ranked tree shapes. We establish an explicit bijection between a class of F -matrices and the space of such tree shapes. The matrix representation has the key feature that the value at any entry is highly constrained by four previous entries, enabling straightforward enumeration of all valid tree shapes. We also use this framework to develop probabilistic models on ranked tree shapes. Our work extends understanding of combinatorial objects that have a rich history in the literature.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Autor:innen und Institutionen
- Fred Hutchinson Cancer Research Center, Seattle, Washington, USA.
- Howard Hughes Medical Institute, Seattle, WA, USA.
- Department of Statistics, Stanford University, Stanford, CA, USA.
- Department of Statistics, Stanford University, Stanford, CA, USA. juliapr@stanford.edu.
- Department of Biomedical Data Science, Stanford School of Medicine, Stanford, CA, USA. juliapr@stanford.edu.
- Fred Hutchinson Cancer Research Center, Seattle, Washington, USA. matsen@fredhutch.org.
Förderung
- National Institute of Allergy and Infectious Diseases
- NIH HHS
- NIAID NIH HHS
- National Science Foundation
- NIGMS NIH HHS
- Office of Research Infrastructure Programs, National Institutes of Health
- National Institutes of Health
- Howard Hughes Medical Institute
Zitieren
APA
Jennings-Shaffer, C., Chen, Z. C., Palacios, J. A., & Matsen, F. A. (2026). Generalizing Matrix Representations to Fully Heterochronous Ranked Tree Shapes. Bulletin of Mathematical Biology, 88(5). https://doi.org/10.1007/s11538-026-01632-4
Vancouver
Jennings-Shaffer C, Chen ZC, Palacios JA, Matsen FA. Generalizing Matrix Representations to Fully Heterochronous Ranked Tree Shapes. Bulletin of Mathematical Biology. 2026;88(5). doi:10.1007/s11538-026-01632-4
BibTeX
@article{JenningsShaffer2026,
author = {Jennings-Shaffer, Chris and Chen, Ziyue Cherith and Palacios, Julia A and Matsen, Frederick A},
title = {Generalizing Matrix Representations to Fully Heterochronous Ranked Tree Shapes},
journal = {Bulletin of Mathematical Biology},
year = {2026},
volume = {88},
number = {5},
doi = {10.1007/s11538-026-01632-4}
}
EUVIMED