Abstract
We prove lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and the Yule--Harding distribution and prove upper bounds under the Yule--Harding distribution. This positively answers a question posed in earlier work. Determining tight upper and lower bounds remains an open problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
