@inproceedings{56b37d31e65a4600ac13baa847da769b,

title = "On the maximum quartet distance between phylogenetic trees",

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(l))(n/4)-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(l)) (n/4). We also give further evidence that the conjecture is true by proving that the maximum distance between caterpillar trees is at most (2/3 +0(1))(n/4).",

author = "Noga Alon and Humberto Naves and Benny Sudakov",

year = "2016",

doi = "10.1137/1.9781611974331.ch146",

language = "English (US)",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "2095--2106",

editor = "Robert Krauthgamer",

booktitle = "27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016",

note = "27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016 ; Conference date: 10-01-2016 Through 12-01-2016",

}