Olivier Boes

Learn More
Given two phylogenetic trees on the same set of taxa X, the maximum parsimony distance d MP is defined as the maximum, ranging over all characters χ on X, of the absolute difference in parsimony score induced by χ on the two trees. In this note we prove that for binary trees there exists a character achieving this maximum that is convex on one of the trees(More)
The hybridization number problem requires us to embed a set of binary rooted phylogenetic trees into a binary rooted phylogenetic network such that the number of nodes with indegree two is minimized. However, from a biological point of view accurately inferring the root location in a phylogenetic tree is notoriously difficult and poor root placement can(More)
  • 1