Enumeration of binary trees compatible with a perfect phylogeny

DOI10.1007/s00285-022-01748-wzbMath1489.05073arXiv2108.04849OpenAlexW3192548743WikidataQ113905373 ScholiaQ113905373MaRDI QIDQ2140024

Noah A. Rosenberg, Julia A. Palacios, Filippo Disanto, Anand Bhaskar

Publication date: 20 May 2022

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

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

zbMATH Keywords

evolutionary modelsbinary ranked tree shapesbinary unranked tree shapes

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Enumeration in graph theory (05C30)

Related Items (1)

A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees

Uses Software

• BEAST
• BEAUti

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the total external length of the Kingman coalescent
• The coalescent
• Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting
• Finding the best resolution for the Kingman-Tajima coalescent: theory and applications
• The number of trees
• Phylogeny
• A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• Inference in Molecular Population Genetics
• The probabilities of rooted tree-shapes generated by random bifurcation
• Fast Computation of Bernoulli, Tangent and Secant Numbers
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: Enumeration of binary trees compatible with a perfect phylogeny