@article{20464b99882e4a07b9220687ed5fddce,

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(1))(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(1)) (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 + o(1)) (n 4).",

keywords = "Flag algebras, Phylogenetic trees, Quartet distance",

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

note = "Publisher Copyright: {\textcopyright} 2016 Society for Industrial and Applied Mathematics.",

year = "2016",

doi = "10.1137/15M1041754",

language = "אנגלית",

volume = "30",

pages = "718--735",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "2",

}