Bounds on the Expected Size of the Maximum Agreement Subtree
classification
🧬 q-bio.PE
cs.DS
keywords
boundsagreementdistributionexpectedlowermaximumsizesubtree
read the original abstract
We prove polynomial upper and lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and Yule-Harding distribution. This positively answers a question posed in earlier work. Determining tight upper and lower bounds remains an open problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.