Name
Abstract | ||
|---|---|---|
We improve the lower bound on the extremal version of the maximum agreement subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same ≥cloglogn leaves which are homeomorphic, such that homeomorphism is the identity on the leaves. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.aml.2009.06.019 | Applied Mathematics Letters |
Keywords | Field | DocType |
Phylogeny,Phylogenetic tree,Maximum agreement subtree,Binary tree,Caterpillar,Cyclic order | Combinatorics,Cyclic order,Upper and lower bounds,Mathematical analysis,Tree (data structure),Algorithm,Binary tree,Mathematics,Homeomorphism | Journal |
Volume | Issue | ISSN |
22 | 11 | 0893-9659 |
Citations | PageRank | References |
5 | 0.83 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mike Steel | 1 | 270 | 41.87 |
| László A. Székely | 2 | 490 | 65.01 |