Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1137/140997750 | SIAM JOURNAL ON DISCRETE MATHEMATICS |
Keywords | Field | DocType |
random trees,agreement subtrees,Yule-Harding distribution | Discrete mathematics,Combinatorics,Open problem,Upper and lower bounds,Tree (data structure),Uniform distribution (continuous),Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
29 | 4 | 0895-4801 |
Citations | PageRank | References |
2 | 0.42 | 5 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Irving Bernstein | 1 | 4 | 1.86 |
| Lam Si Tung Ho | 2 | 18 | 4.96 |
| Colby Long | 3 | 4 | 1.50 |
| Mike A. Steel | 4 | 210 | 22.33 |
| Katherine St. John | 5 | 2 | 0.42 |
| Seth Sullivant | 6 | 93 | 19.17 |