2000 character limit reached
Bounds on the Expected Size of the Maximum Agreement Subtree (1411.7338v2)
Published 26 Nov 2014 in q-bio.PE and cs.DS
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.