Name
Abstract | ||
|---|---|---|
A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on n leaves is at most (2/3 + o(1))(n4). Using the machinery of flag algebras we improve the currently known bounds regarding this conjecture, in particular we show that the maximum is at most (0.69 + o(1))(n4). We also give further evidence that the conjecture is true by proving that the maximum distance between caterpillar trees is at most (2/3 + o(1))(n4).
|
Year | DOI | Venue |
|---|---|---|
2016 | 10.5555/2884435.2884581 | SODA '16: Symposium on Discrete Algorithms
Arlington
Virginia
January, 2016 |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Phylogenetic tree,Conjecture,Mathematics | Conference | abs/1505.04344 |
Issue | ISBN | Citations |
2 | 978-1-61197-433-1 | 0 |
PageRank | References | Authors |
0.34 | 12 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noga Alon | 1 | 10468 | 1688.16 |
| Humberto Naves | 2 | 24 | 4.08 |
| Benny Sudakov | 3 | 1391 | 159.71 |